跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 00:32 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 00:52 — 2026-11-15 00:52(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 00:32最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 42 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 00:30(北京时间)
版本更新 · v4arXiv:2504.21058

Symmetric compatibility of theta structures, with applications to change of level and isogenies

Antoine Dequay, David Lubicz

原文摘要

Let $m,n,d >1$ be integers such that $n=md$ and let $(B, \mathscr{M}, Θ\_{\mathscr{M}})$ be a marked abelian variety of level $m$ over a field of odd characteristic. We study the theta structures of level $n$ for $\mathscr{M}^d$, and the theta structures on the abelian varieties $d$-isogenous to $B$, which are compatible with $Θ\_{\mathscr{M}}$. When $d$ is odd and coprime to $m$, they correspond to the isotropic subgroups of $B[n]$, and this correspondence underlies the known algorithms in theta coordinates. In general, this is no longer true. We introduce the notion of symmetric compatibility of a torsion point with a symmetric level subgroup, and we show that a subgroup of $B[n]$ isomorphic to $(\mathbb{Z}/n\mathbb{Z})^g$ comes from a compatible theta structure if and only if it is isotropic and all its points are symmetric compatible. We extend to every $d$ Mumford's notion of compatible pairs of theta structures, defined by Mumford for $d=2$, and prove that it is equivalent to our notion, which can be tested on theta coordinates; we also describe exactly the remaining ambiguity, which explains the sign choices met when the duplication formula is used to change the level. As applications, we obtain change of level and isogeny algorithms without assuming that $d$ is odd and coprime to $m$, using $O(n^{3g} \log(d))$ and $O(n^{2g} \log(d))$ operations in the base field respectively. In particular, they give change of level algorithms for even $d$, and $2$-isogenies in level $4$ theta coordinates with an explicit control of the theta structure of the codomain.

cs.SC · math.NT

版本更新 · v2arXiv:2609.33663

LieDiscover: Adaptive Symbolic Library Construction for Explicit Open-form Symmetry Discovery

Xinxin Li, Jianming Ma, Xingyu Cui, Da Li, Juan Zhang, Junping Yin

原文摘要

Discovering symmetries from observational data provides interpretable insights into dynamical systems and priors for scientific machine learning. However, existing symmetry discovery methods face two limitations. Many methods represent symmetries implicitly, making it difficult to obtain explicit infinitesimal generators that can serve as physical priors for learning dynamical systems. Meanwhile, methods that explicitly identify generators often rely on predefined function libraries, limiting their ability to capture complex symmetries involving high-order polynomials or transcendental functions. To address these limitations, we propose LieDiscover, a framework that explicitly identifies infinitesimal generators through an iterative symbolic search process that dynamically expands the symbolic function library to capture complex functional forms. Specifically, at each search step, we design an encoder-decoder architecture to generate a candidate symbolic expression. An adaptive singular value decomposition (SVD)-based evaluation is introduced to assess how each candidate contributes to the recoverable symmetry subspace. The resulting evaluations are incorporated into step-wise rewards to guide reinforcement learning toward discovering richer symmetry structures with concise symbolic representations. Experiments on eight partial differential equation (PDE) benchmarks demonstrate that LieDiscover recovers explicit generators involving higher-order polynomial, exponential, and trigonometric terms, while achieving more accurate symmetry subspace recovery and improved robustness to noise. Furthermore, the recovered generators enable effective symmetry-based data augmentation, improving the accuracy of downstream neural PDE solvers.

cs.SC · cs.LG

版本更新 · v3arXiv:2610.19148

Program Learning with Verifiable Rewards: Distilling Expert Traces into Programs

Vishvesh Bhat, Muhammad Ahmed Mohsin, Asad Aali

原文摘要

Small language models struggle with tool-use tasks that require following multi-step procedures. Whether these failures reflect limited capability or missing procedural knowledge remains unclear. We introduce Program Learning with Verifiable Rewards (PLVR), which distils expert traces into reusable programs without updating model weights. Frontier models turn recurring operations in the traces into typed primitives and rules, and search assembles them using reference actions and training-task checks. A small frozen model executes the primitives, with deterministic verifiers checking their outputs. The resulting program guides a student's reasoning or checks its proposed actions. We evaluate the same program across students on $τ^2$-Bench Retail and Telecom and LiveMCPBench, using synthetic training tasks and unseen benchmark test tasks. On Telecom, PLVR raises an 8B model's success rate from 43.0% to 91.2%, while larger students reach up to 94.4%, compared with 57.9% for the best baseline. On Retail and LiveMCPBench, PLVR is competitive with the best baselines, although tool search remains more dependent on the student model. These results support program learning as a way to transfer expert procedures across frozen models, trading additional inference computation for more reliable tool use.

cs.AI · cs.SC

新论文 · v1arXiv:2611.16073

Agentic Computational Algebra

Ryan A. Anderson, Matthew Trager, Ben Bowman, Wei Xia, Stefano Soatto

原文摘要

We explore the use of AI agents for solving computational problems in algebra. For the problems we consider, the main challenge is not correctness but \emph{time}: general-purpose algorithms are guaranteed to provide correct solutions but can be prohibitively slow, while reformulations that exploit special structure often allow solving a problem much faster. We propose to use this setting to evaluate how effectively agents discover and exploit structure within and across tasks to reduce computational costs. More broadly, computational algebra supplies infinitely many problems with independently verifiable answers and systematically controllable structure and difficulty. To illustrate these possibilities, we use benchmark families of systems with controlled shared structure and evaluate agents in three settings: solving independent instances, solving online streams of related instances using persistent memory, and compiling a fast reusable solver for a known problem family. Our experiments show that (i) agents can extend the range of systems solvable within a fixed budget, although reasoning overhead can sometimes outweigh computational savings; (ii) memory can reduce the cost of repeated solving but may preserve suboptimal strategies; (iii) compilation produces faster reusable solvers but at substantial upfront cost. Overall, computational algebra offers concrete, measurable targets for improving how agents discover and reuse structure.

cs.LG · cs.AI · cs.SC

新论文 · v1arXiv:2611.15596

Bug Finding With Agentic Symbolic Execution

George Granberry, Wolfgang Ahrendt, Andy Gordon, Moa Johansson

原文摘要

Symbolic execution, in tools such as CrossHair for Python, is a powerful technique for finding bugs, but two barriers hinder its adoption: the human effort of annotating code with assertions, and the need to model the execution environment outside Python, such as an external database. To overcome both, we design an agentic harness that orchestrates the symbolic execution tool CrossHair together with an AI coding agent. Without human intervention, it instruments a repository with assertions, synthesizes a constraint-aware symbolic environment for the database, runs symbolic execution, and constructs a concrete test as evidence for each bug it reports. We evaluate our harness on 1,156,044 lines of Python code over 11 popular open-source Python web applications (Zulip, NetBox, Apache Superset, and others). With the synthesized environment, CrossHair executes 81% of the 5,406 contracted functions, against 4.5% without it. Our pipeline finds 1,050 bugs, each reproduced by a test against the unmodified application, 221 of them by CrossHair, and 312 of them are missed by a baseline in which the same LLM inspects the code. The two find different kinds of bugs: CrossHair's are mostly crashes on input-domain corner cases that validation admits, such as empty strings, missing fields and unusual characters, while inspection's are mostly bugs that produce wrong output. Our framework thus lets symbolic execution supplement inspection-based bug finding.

cs.SE · cs.AI · cs.LO · cs.SC

新论文 · v1arXiv:2611.15307

Floating-point, exact and certified computation for control: paradigms, pitfalls, and how to combine them

Christina Katsamaki, Fabrice Rouillier

原文摘要

Many questions in linear systems theory have a discrete answer: is a polynomial Hurwitz, is a 2-D system structurally stable, is the peak gain finite, which solution of a Riccati equation is stabilizing? Algorithms implemented in floating point usually answer such questions, but often with a limited, or even no, guarantee on the result, which depends on a tolerance fixed a priori. Computer algebra and interval arithmetic provide other ways of computing, which give guarantees on the result, but usually at a higher cost. In this paper, we propose a short guide to these approaches: floating-point, exact, multiprecision and interval arithmetic, certified root isolation and certified Newton methods. Using small examples from control theory (each of them runs in a few seconds), we show what each approach guarantees and in which situations it fails, and how several approaches can be combined, for example by certifying a numerical solution, or by reducing a problem exactly before solving it with certified real solving. We then revisit the structural stability of 2-D systems (with and without parameters) and the computation of the $H_\infty$ norm, and we list the available implementations. The main examples are given as reproducible worksheets based on the PACE ecosystem.

cs.SC

版本更新 · v4arXiv:2504.16771

Projective Variety Recovery from Unknown Linear Projections

Yirmeyahu Kaminski

原文摘要

We study how a smooth irreducible variety $X$ of dimension $n$ and degree $d$ in $\mathbb{P}^m$, $m\geq n+2$, can be recovered from the equations of its images under two generic projections from unknown centers. This extends earlier results on curves in $\mathbb{P}^3$ and surfaces in $\mathbb{P}^4$ to any dimension. Since $X$ is the normalization of each image, one image determines $X$ modulo the projective group when $X$ is linearly normal; what two images add is the configuration, that is the pair of projections. For complete intersections we prove unconditionally that the set of configurations compatible with the two images and their Hilbert polynomial is finite, of size at most $|\mathrm{Lin}(X)|$, the projective automorphism group of $X$. The argument is effective and the bound is attained. We then introduce an equation generalizing Kruppa's equation, relating the duals of the images to a fundamental matrix, encoding the pair of projections modulo the projective group. We give a necessary condition for its solution variety to be finite, a bound on its isolated points, and a sufficient condition under which the true fundamental matrix is rigid: no quadric may contain a generic line $L$ together with the locus of points of $X$ whose tangent space meets $L$. Rigidity is unconditional for curves; in higher dimension it holds under a first-order liftability hypothesis, which we certify for a del Pezzo quartic surface in $\mathbb{P}^4$. Global finiteness of that solution variety remains open, necessarily so, as it contains solutions realized by no variety; for $\dim X<\mathrm{codim}\,X-1$ the obstruction amounts to knowing the fundamental matrix itself. Once the projections are known, $X$ is recovered from the two cones over the images: in codimension two their intersection is $X$ plus a component of degree $d(d-1)$; in higher codimension $X$ is its unique component of maximal dimension.

math.AG · cs.SC

新论文 · v1arXiv:2611.15258

Exact Decisions and Certified Values in $L_\infty$-Norm Computation from State-Space Representations

Alban Quadrat, Fabrice Rouillier, Grace Younes

原文摘要

Computing the $L_\infty$-norm of a time-invariant linear ordinary differential control system is a routine task in robust control, usually delegated to floating-point routines that perform well on most practical systems. Behind the numerical value, however, lies a discrete decision: whether a pole lies on the imaginary axis, and whether a mode of a realization is actually a pole of the transfer matrix. Floating-point arithmetic can only replace this decision with a tolerance. This paper explains, for a control audience, what reliable symbolic-numeric computation offers for this problem: exact arithmetic where a decision has to be made, and certified enclosures where a value has to be computed. We show how the problem is turned into a small polynomial system directly from state-space data, how this system is solved in practice, and what it costs. A benchmark on the {\tt COMPleib} library and on families of systems with known norms shows that two standard numerical routines err in opposite directions on the imaginary-axis decision, and never on the same system, while the certified method decides it correctly on every instance tested and computes the norm at a cost comparable to that of the numerical routines on most systems. We conclude with practical guidelines for users of numerical tools.

math.OC · cs.SC

版本更新 · v2arXiv:2610.30907

Near-Quadratic Time Multivariate Polynomial Interpolation

Chandra Kanta Mohapatra

原文摘要

Let $\F$ be a finite field. Given $N$ distinct points $\bmα_1,\ldots,\bmα_N \in \F^m$ and associated values $β_1,\ldots,β_N \in \F$, we study the problem of computing an $m$-variate polynomial $f(\vy) \in \F[\vy]$ of individual degree less than $d$, with $d^m \ge N$, that satisfies $f(\bmα_i)=β_i$ for all $i\in[N]$, whenever such an $f$ exists. This is known as the\textit{ multivariate polynomial interpolation} problem. In this work, given $N=d^m$, we present a deterministic algorithm for multivariate polynomial interpolation over an arbitrary finite field $\F$ that runs in near-quadratic time $N^{2+o(1)}\poly(m,d,\log|\F|)$, assuming $d$ is $ω(1)$. This bound holds whenever the associated \emph{multivariate Vandermonde} matrix is nonsingular, has constant co-rank, or admits some special structure. In the general case, we give a randomized Las Vegas algorithm attaining the same near-quadratic running time, provided the finite field is sufficiently large and $d$ grows similar to the previous case. Unlike other multivariate interpolation strategies, we do not assume black-box access to the polynomial. In particular, we are not permitted to query arbitrary input points to obtain their evaluations. Our interpolation result follows by combining Wiedemann's classical approach~\cite{w86} for solving sparse linear systems with known bounds for fast \emph{multivariate multipoint evaluation} over finite fields~\cite{umans08, KU11, BGKM23, BGGKU24}. Specifically, our deterministic interpolation strategy relies on a deterministic variant of Wiedemann's approach, which is more commonly used in the randomized setting.

cs.DS · cs.CC · cs.SC

版本更新 · v3arXiv:2510.00892

An Effective Version of Kronecker's Theorem on the Splitting of Polynomials and the $p$-Curvature Conjecture for Order One Differential Equations

Florian Fürnsinn, Lucas Pannier

原文摘要

We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Padé approximation. In conjunction with Honda's proof of the $p$-curvature conjecture for order one equations with polynomial coefficients we use this to deduce an effective version of the Grothendieck $p$-curvature conjecture for order one equations. More precisely, we bound the number of primes for which the $p$-curvature of a given differential equation has to vanish in terms of the height and the degree of the coefficients, in order to conclude it has a non-zero algebraic solution. Using this approach, we describe an algorithm that decides algebraicity of solutions of differential equation of order one using $p$-curvatures, and report on an implementation in SageMath.

math.NT · cs.SC

版本更新 · v2arXiv:2611.05664

Combining Relevant Expert Knowledge Using Mixtures of Feedback Fuzzy Cognitive Maps

Olaoluwa Adigun, Akash Kumar Panda, Bart Kosko

原文摘要

A neuro-symbolic system should combine only relevant answers from expert agents or other knowledge sources. Using only relevant experts for a given input query becomes ever more important for accuracy and scalability as the knowledge network grows and connects ever more knowledge sources. We extend the standard definition of relevance from the legal theory of evidence: An answer is relevant if and only if it is both probative and material for the matter at hand given the knowledge available. We apply this relevancy scheme to mixing the feedback fuzzy cognitive maps (FCMs) of real or artificial experts. The expert FCM directed causal graphs mix or combine into a common knowledge network. We compare the equilibrium limit-cycle predictions or answers of the experts to the answers of the mixture FCM and then estimate the probative status of answers by their difference or variation. A new Bayes-like theorem de-mixes the knowledge mixture into corresponding posterior-like FCMs that also allow relevancy-based comparisons. The result is a final set of relevancy mixing weights that produces a relevancy-mixed FCM knowledge network for the given query. So different queries produce different relevancy-mixed FCMs. We demonstrate this relevancy approach using generated synthetic FCMs from an actual 13-node expert FCM that models the causes and feedbacks of ischemic-stroke risk.

cs.AI · cs.IR · cs.SC

版本更新 · v6arXiv:2511.15238

A Quantitative Approach to Reach-Avoid Reachability Analysis for Discrete-Time Nonlinear Control Systems

Ihab Tabbara, Eliya Badr, Hussein Sibai

原文摘要

A reach-avoid specification requires a dynamical system to reach a target set of states while avoiding a failure set. Reachability analysis partitions the state space into parts starting from which the specification can be satisfied by following some control signal and those from which it cannot despite the best control effort. In this paper, we present a quantitative approach for reachability analysis to analyze the satisfaction of avoid and reach-avoid specifications for discrete-time nonlinear control systems. In such an approach, a value function assigns a value to each state that determines how robustly the system satisfies or violates the specification starting from it and following the optimal control signal. However, computing such a value function is difficult. Instead, our approach constructs discrete abstractions on which it performs value iteration to compute sound bounds on the desired value function. The resulting lower bound enables a sound under-approximation of the reach-avoid set (RAS) and, in the avoid case, a sound over-approximation of the backward reachable set (BRS). When the control set is finite, the upper bound additionally enables a sound over-approximation of the RAS and, in the avoid case, a sound under-approximation of the BRS. Moreover, the obtained bounds provide quantitative guarantees on safety margins and, in discounted reach-avoid problems, on safe target-reaching times. When the control set is finite, they also bound failure-reaching times. Our approach further refines the abstraction by splitting the grid cells that could not be classified as within or outside the BRS (or RAS) to improve the bounds. We evaluate our approach on five systems with up to five-dimensional state spaces.

eess.SY · cs.FL · cs.SC

版本更新 · v3arXiv:2608.11211

Conway 99-图问题的强制结构约化与可验证界

A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph

Aalok Thakkar, Simone Severini

AI 速读 基于摘要

作者通过固定一个顶点把 srg(99,14,1,2) 的存在性问题约化为 84 个顶点上的受约束 12-正则图,并用 CP-SAT、循环图枚举和进化式程序搜索给出可验证的部分得分上界与构造。

cs.AI · cs.SC · math.CO

查看原文摘要

Conway's 99-graph problem asks whether a strongly regular graph with parameters srg(99,14,1,2) exists. We develop two complementary lines of attack. Fixing one vertex, the conditions lambda=1 and mu=2 force its neighbourhood to be a perfect matching and determine every edge between that neighbourhood and the remaining vertices. For (99,14,1,2), the unresolved part is therefore a constrained 12-regular graph on 84 vertices. We encode this reduction in CP-SAT and validate it by recovering the unique srg(9,4,1,2). We also prove by exhaustive enumeration that no circulant graph on Z/99 satisfies more than 68.0% of the CAISc constraints, and we give a validated orbit formulation for prescribed automorphisms. We then study the partial-score search problem. Fourteen human-designed search configurations reached at most 69.43%. Separately, we supplied the scoring function to an evolutionary program-search system. It produced a degree-preserving 4-vertex-switch tabu search whose best verified artifact scores 70.73%. The generated move differs from those used in our own searches and crosses a plateau that was stable under them. A tabu search restricted to graphs with a prescribed symmetry group, first Z/33 and then its subgroup of order 11, reaches a 14-regular graph scoring 76.67%. These results do not resolve the existence problem, but they reduce the exact search space and improve the best verified partial construction found in our experiments.

新论文 · v1arXiv:2611.13048

Reliable Computation of the $L_{\infty}$-Norm of Linear Time-Invariant Systems Depending on One Parameter

Florent Corniquel, Alban Quadrat, Fabrice Rouillier, Grace Younes

原文摘要

The $L_{\infty}$-norm of a linear time-invariant system is a central quantity in robust control, used in robust stability tests, stability margins, and $H_{\infty}$ controller design. Physical models depend on parameters, such as masses, stiffnesses, or gains, so the $L_{\infty}$-norm becomes a function of these parameters. This computation reduces to studying the real critical points of a plane algebraic curve whose coefficients depend on the parameters. Previous approaches based on cylindrical algebraic decomposition describe the $L_{\infty}$-norm on the whole parameter space, but their cost grows very quickly with the number of parameters. In this paper, we propose instead to compute a generic parametrisation of the solutions, valid outside an explicitly characterised set of non-generic parameter values. In the case of one parameter, this parametrisation is obtained by interpolation from a certified solver for the non-parametric case. The resulting algorithm is fully certified, relying on a priori bounds and multimodular computations rather than on Gröbner bases. It is illustrated on examples from the robust control literature.

cs.SC

新论文 · v1arXiv:2611.12157

FORM 5.0 and further developments

Ana Costa Pereira, Joshua Davies

原文摘要

In these proceedings we review the features of the recently-released version 5.0 of the FORM computer algebra system, which is one of the core software packages for the large-scale symbolic manipulations required by calculations in theoretical high-energy physics. We also discuss developments since the release of version 5.0, focussing in particular on recent performance improvements.

hep-ph · cs.SC

新论文 · v1arXiv:2611.11641

Spectral Stability, Fatou Basin Contraction, and Machine-Checked Multipliers in Holomorphic Extensions of Generalized Syracuse Dynamics

Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı, Emrah Yurtseven, Murat Emre Özkaya

原文摘要

We embed the Syracuse operator $T(n) = n/2$ (even $n$), $T(n) = (3n+1)/2$ (odd $n$) and the Collatz map $C(n)$ into $\mathbb{C}$ via entire functions of exponential type $π$: $f(z) = \frac{1}{4}(1 + 4z - (1 + 2z)\cos(πz))$ and $F(z) = \frac{1}{4}(2 + 7z - (2 + 5z)\cos(πz))$. We prove five results: (1) every integer periodic cycle $C \subset \mathbb{N}^+$ of $T$ is a strictly attracting Fatou cycle of $f$ with multiplier $μ_f(C) = 3^{N_{\mathrm{odd}}}/2^N = \prod_{n \in C\text{ odd}} \frac{3n}{3n+1} \in (0,1)$, and $μ_f(O_{1,2}) = μ_F(O_{1,4,2}) = 3/4 < 1$; (2) on the Fatou basin $B(O_{1,2})$, $g = f^{\circ 2}$ conjugates to $Φ_j(g(z)) = \frac{3}{4}Φ_j(z)$ with Koenigs Taylor jets $c_2(1) = -\frac{13}{2}π^2$ and $d_2(2) = -\frac{9}{2}π^2$; (3) the Schwarzian derivative is strictly negative on $\mathbb{Z}$ ($S(f)(n) \le 3π^2 - \frac{3}{8}π^4 \approx -6.9196 < 0$), and a repelling Julia 2-cycle $O_{\mathrm{rep}} \subset J(f)$ ($μ\approx 1.2148 > 1$) isolates $B(O_{1,2})$; (4) on $(\mathbb{Z}_2, μ_{\mathrm{Haar}})$, the 2-adic Lyapunov exponent $λ_{\mathrm{Haar}} = \frac{1}{2}\ln(3/4) \approx -0.143841 < 0$ equals $\frac{1}{2}\ln|μ_f(O_{1,2})|$; and (5) we certify 20 theorems in Lean 4 (anc/CollatzAttractor.lean, 0 sorry). These results establish local Fatou invariants and 2-adic ergodic averages for $f(z)$, leaving open whether every $n_0 \in \mathbb{N}^+$ lies in $\bigcup_{k \ge 0} f^{-k}(B(O_{1,2}))$.

cs.LO · cs.SC · math.CV · math.DS

版本更新 · v3arXiv:2405.12886

Improved Asymptotic Runtime of Gotzmann's Decomposition

Joseph Donato

原文摘要

In the study of Hilbert schemes, the integer partition or Gotzmann's decomposition of a Hilbert polynomial helps researchers identify some geometric and combinatorial properties of the scheme in question. To aid researchers in extracting such information from a Hilbert polynomial, we describe an efficient algorithm which can identify if $p(x)\in\mathbb{Q}[x]$ is a Hilbert polynomial and if so, recover the integer partition $λ$ associated with it.

cs.SC

新论文 · v1arXiv:2611.10920

Positivity Proofs for Third-Order Holonomic Sequences via Differences Scaled by Rational Functions

Fugen Hagihara

原文摘要

We study the positivity of sequences $f$ that satisfy a third-order holonomic recurrence $f(n+3)= P_2(n) f(n+2) + P_1(n) f(n+1) + P_0(n) f(n)$ whose coefficients $P_0$, $P_1$ and $P_2$ are rational functions in $\R(x)$. We provide a sufficient condition on $P_0$, $P_1$ and $P_2$ for the recurrence to admit a solution all but finitely many terms of which are positive, and whose positivity is robust under small perturbations of the initial values. This sufficient condition is also a necessary condition for a subclass of the recurrences. By developing the proof of this sufficient condition, for another subclass of the recurrences, we show that it is decidable whether all the terms of a given sequence are positive for any initial values outside an exceptional plane. It is common to construct a positivity certificate, which guarantees the positivity of a solution, to show this kind of decidability. In this paper, we construct a new type of positivity certificate via the $S$-scaled difference $f(n+1) - S(n) f(n)$ for a suitable $S \in \R(x)$. This result partially improves the work by Ibrahim and Salvy.

cs.DM · cs.SC · math.DS

版本更新 · v2arXiv:2610.36985

Introducing Barik transform and Barik eliminant: novel tools for solving polynomial equations in the sine and cosine of one variable

Sandipan Bandyopadhyay

原文摘要

Systems of trigonometric equations appear frequently in problems related to geometry, kinematics, computer graphics, robotics, and astronomy, among many other fields. Most often, these are first converted to algebraic equations via the "tangent half-angle" substitution and solved subsequently using various algebraic methods, such as computation of resultants or Gröbner bases. In the process, parametric singularities are introduced in the equations, and their degrees are also doubled. In this article, a novel concept called the "Barik transform" is introduced, which can help solve such a system without encountering these issues, albeit only in systems that contain at least one equation of the first degree in the sine and cosine of the variable to be eliminated. It is shown how Barik transform can produce extremely compact eliminants in closed form, without resorting to any resultant computation.

cs.SC

新论文 · v1arXiv:2611.07786

On computing the determinant over a ring

Gilles Villard

原文摘要

An algorithm is presented for computing the determinant and the characteristic polynomial of a matrix $A$ over an arbitrary commutative ring R. The algorithm uses $O(n^ω)$ ring additions, subtractions and multiplications, where $ω>2$ is a feasible exponent for matrix multiplication, that is, such that two $n\times n$ matrices over R can be multiplied using $O(n^ω)$ ring operations. The algorithm involves no division and no zero test, and its control depends only on $n$: for each $n$ it is a straight-line program. The approach combines a polynomial matrix point of view and a block Krylov point of view on the characteristic polynomial, which makes Strassen's elimination of divisions efficient. A bivariate matrix $λI-L(t)$, obtained from $A$ by a homotopy, is compressed in $\log n$ steps, each of which halves the dimension while only doubling the degree in $λ$. The cost of the homotopy is controlled by truncating the power series in $t$ at an order that only grows with the compression steps, from a constant to $n$.

cs.SC · cs.CC

版本更新 · v2arXiv:2607.22944

Invariant Discovery for Networked Systems

Hongyu Hè, Alexander Krentsel, Sylvia Ratnasamy, Maria Apostolaki

原文摘要

Invariants, the relations expected to hold among measured signals of a network, underpin applications from verification to traffic generation, telemetry imputation, and input validation. Yet, writing them by hand demands rare expertise in both formal logic and networking. Testing all possible combinations of telemetry variables statistically is intractable at network scale, while existing automatic tools still require a human-authored grammar of admissible invariants and learn only exact, "hard" rules that break under real-world noise. Our key idea is to use an LLM to inspect variable metadata, classify counter data types, and predict candidate syntactic relationships that form a compact grammar, followed by a deterministic statistical search within that grammar. If the initial grammar fails to recover trusted known invariants on held-out telemetry, Autogram instructs the LLM to iteratively widen the grammar until recovery succeeds. By confining the LLM to grammar induction and re-induction while delegating candidate verification to logical and statistical checks, Autogram turns non-deterministic AI proposals into auditable invariants with formal guarantees within the induced grammar. We design and prototype Autogram and evaluate it on both public and production WAN telemetry, recovering expert-derived invariants with full recall and low false positives. We close with a discussion of open problems on the path toward fully open-ended invariant discovery.

cs.NI · cs.AI · cs.LG · cs.SC

新论文 · v1arXiv:2611.07254

Using Transformers for Teaching and Learning via Symbolic Distillation of Neural A-life Agents

Shuwei Wang, Vadim Bulitko, Matthew R. G. Brown, Michael Youngblood, Ramon Lawrence, Roscoe Smith, Shinichi Nakagawa, William Yeoh

原文摘要

Neural networks controlling behavior of A-life agents can evolve over multiple generations. While effective in making the agents survive, such networks are generally opaque to a human observer. Furthermore, the neural weights cannot be transferred between agents with different neural architectures. Distilling such neural networks into compact symbolic policies can help humans understand agent behavior in A-life. Additionally, it allows the agents to share their knowledge in a compact fashion, improving population-level learning. Distilling a neural policy into a symbolic policy is typically performed by searching the space of symbolic policies to find one that approximates the neural policy. However, even with a domain-specific language the space of policies can be large, necessitating incomplete stochastic search such as genetic algorithms. Yet the distillation remains computationally expensive. We propose to instead use a transformer pre-trained on readily available random percept-action data. Doing so speeds up distillation substantially. We derive the transformer architecture via a neural architecture search. Empirical results compare different distillation methods and the influence of the symbolic space on A-life population dynamics through self-reflection and teaching and learning.

cs.LG · cs.SC

新论文 · v1arXiv:2611.06315

Exact certification for conic optimization over quadratic modules: partitions of unity and recession directions

Didier Henrion, Alaa Ibrahim, Victor Magron

原文摘要

We consider linear conic problems whose cone is a product of truncated quadratic modules, the sum-of-squares (SOS) side of the moment-SOS hierarchy. A floating-point solution is turned into an exact rational certificate in three steps: rounding, repair of each block residual by a constant, and absorption of the constants along a recession direction of the problem. The repair relies on strict partitions of unity in the quadratic modules. We characterize their existence, relate the canonical one to the analytic center of the dual pseudo-moment cone, Christoffel-Darboux polynomials and Pell equations, and we derive closed-form rational partitions for balls and boxes. The loss incurred by the certification is the optimal value of a recession problem, equal to a support function of the masses of the dual feasible pseudomoments. The method is illustrated on polynomial optimization, volume computation and positivity of polynomials along D-finite trajectories.

cs.SC · math.OC

版本更新 · v2arXiv:2605.19379

Graph-based Automated Discovery of Concise Soil Hydraulic Functions from Data: Beyond Empirical Formulations

Hao Xu, Jinshen Sun, Yuntian Chen, Dongxiao Zhang

原文摘要

Soil hydraulic functions underpin water flow and transport modeling in the vadose zone, yet they are commonly represented by expert-designed formulations such as the Mualem-van Genuchten (MvG) model. Because these formulations rest on predefined functional assumptions, balancing predictive accuracy and parametric compactness across soil textures remains challenging. Here we introduce a graph-based equation discovery framework that distills soil hydraulic functions from experimental data. Reapplied to the original datasets that motivated the MvG parameterization, the framework recovers a concise water retention function together with an analytical unsaturated hydraulic conductivity expression whose mathematical structure departs from classical empirical forms. Evaluated across soils of contrasting texture, the discovered model predicts unsaturated hydraulic conductivity more accurately than MvG and its common variants, while its fitted parameters retain interpretable correlations with measurable soil physical properties. These findings suggest that data-driven discovery can yield compact, analytically tractable constitutive relations that move beyond fixed empirical formulations.

physics.flu-dyn · cs.SC · physics.geo-ph

新论文 · v1arXiv:2611.05514

Where models of minimal height are hard to find: cubic rational maps with a multiple fixed point

Elira Shaska

原文摘要

Given a rational point of the moduli space of cubic rational maps, we seek a map in its class with the smallest integer coefficients. A recent algorithm (Shaska, arXiv:2610.33990) combines an exact descent and minimisation of the resultant with a reduction and a local search; it is nearly exact where the minimal height is known. Beyond that range, a certified deeper search shows that the instances in which a smaller model lies beyond its reach are not random: a classifier predicts them from the six invariants of the point, and asking what it relies on leads to an exact algebraic surface, the maps with a triple fixed point. Invariant theory and the stability hypothesis of reduction theory (Hutz and Stoll, 2019) then identify the larger locus that contains it: the hypersurface $ξ_1^3=6ξ_2^2$ of maps with a multiple fixed point, on which the fixed-point quartic is not stable. It holds most of the hard instances. On it the two invariants of the fixed-point quartic are $(ξ_1,ξ_2)=(6m^2,6m^3)$ for an integer $m\ge0$; we parametrise the integer points of the surface, and show that on its generic part the sign of $ξ_5$ is the sign of the cubic coefficient at the parabolic fixed point. A covariant defined on the locus, added to the reduction, resolves only a minority of the hard instances: they appear to be mainly a matter of the search's reach. These findings lead to a certified structured search that never returns a larger model than the original algorithm and finds most of the smaller models within reach, also at heights not used to design it, at a small multiple of its running time.

cs.SC

新论文 · v1arXiv:2611.05289

通过 Chow 形式在 CH 中进行的若干代数与几何计算

Some algebraic and geometric computations in CH via Chow forms

Robert Andrews, Abhibhav Garg, Rafael Oliveira, Éric Schost

AI 速读 基于摘要

作者报告可将若干等维分解相关判定问题与近似多项式可满足性问题的复杂度上界从 PSPACE 改进到计数层级 CH,核心技术是构造计算 Chow 形式的 polylogtime 一致常数深度指数规模阈值电路。

cs.CC · cs.SC

查看原文摘要

The problem of decomposing an algebraic variety into more structured components (such as equidimensional, irreducible, or connected components) is a fundamental problem in computer algebra and algebraic geometry. In this work, we study the computational complexity of computing equidimensional components of algebraic varieties, represented via Chow forms. We improve the state-of-the-art complexity bounds from PSPACE to CH, the counting hierarchy, for a number of problems related to equidimensional decomposition, including deciding (1) whether the Chow form of the $k^{\text{th}}$ equidimensional component of a given projective variety vanishes at a given point, (2) whether a given monomial is in the support of the Chow form of the $k^{\text{th}}$ equidimensional component of a given projective variety, (3) membership in a given equidimensional component of a given algebraic variety, and (4) membership in the closure of the image of an irreducible variety under a polynomial map. As an application of our algorithm to decide membership in the closure of the image of a variety under a polynomial map, we show that the approximate polynomial satisfiability problem can be decided in CH. We also show that the degree of the $k^{\text{th}}$ equidimensional component of a given projective variety can be computed in $\text{FP}^{\text{CH}}$. Our main technical result is the construction of a polylogtime-uniform family of constant-depth, exponential-size threshold circuits that compute the Chow forms of the equidimensional components of a given projective variety. We construct these circuits by combining the machinery of geometric resolutions together with the uniform constant-depth, exponential-size threshold circuits of Andrews, Garg, and Schost (FOCS 2026) for the multivariate resultant.

新论文 · v1arXiv:2611.05039

ALBI: LLM-Guided Inductive Logic Programming via Iterative Generate-Test-Constrain Refineme

Aboubaker Seddiq Benterki, Jüri Vain, Gert Kanter, Leelo Aino Jürgenstein

原文摘要

We introduce ALBI (Agent for Learning By Induction), a neuro-symbolic ILP framework that replaces the ASP-based hypothesis generator in the Learning from Failures (LFF) paradigm with a Large Language Model (LLM), while retaining SWI-Prolog as a formal verifier. ALBI implements an iterative generate-test-constrain loop: the LLM proposes candidate hypotheses from structured prompts; Prolog tests each candidate; and diagnostic feedback drives refinement. We further introduce semantic anonymization, a metamorphic testing methodology, to distinguish structural symbolic induction from surface-level pattern matching on predicate names. Experiments on 30 standard ILP benchmarks show that ALBI achieves 100% success across three frontier LLMs (Gemini 3.1 Pro, GPT 5.4 Pro, Claude Opus 4.6), matching Popper while requiring only 1.4-1.7 iterations on average. Under anonymization, all models maintain 100% success with a moderate iteration increase (1.36-1.67 times), providing evidence of robust symbolic reasoning.

cs.AI · cs.SC

新论文 · v1arXiv:2611.04730

Finding Integer Roots of Polynomials in Nearly Optimal Time

Yansong Feng, Itamar Nir

原文摘要

Let $f\in\mathbb Z[x]$ be a polynomial of degree $n$ with integer coefficients of absolute value less than $2^b$. Using Pan's approximate factorization theorem, we give a deterministic algorithm that finds all distinct integer roots of $f$ in $\widetilde O(nb)$ bit operations. This matches the bit size of the input up to logarithmic factors and does not require $f$ to be square-free. Since we were unable to verify parts of the running time analysis of Pan's theorem, we also give a self-contained deterministic algorithm with running time $\widetilde O(nb+\min(n,b)^3b^2)$, which is $\widetilde O(nb)$ whenever $b\leq n^{1/4}$. This answers a question of Harvey and Hittmeir (2022), who asked whether integer roots can be found deterministically in quasilinear time, conditionally on Pan's theorem, and unconditionally for $b\leq n^{1/4}$. The fastest previous deterministic algorithm, due to Nir, takes $\widetilde O(n^{3/2}b)$ bit operations and works only for square-free polynomials. Instead of $p$-adic lifting, we combine approximate complex root finding with exact polynomial evaluation. We first approximate the complex roots of the polynomial formed by the top $\min(n,b)+1$ coefficients of $f$. Every integer root $r$ of $f$ with $|r|\geq 2$ lies within distance $2$ of some complex root of this truncated polynomial. Rounding the real parts of the approximate roots therefore gives a list of $O(\min(n,b))$ candidate integers that is guaranteed to contain all integer roots of $f$. Although a single candidate can have up to $b$ bits, a bound via the Mahler measure shows that the bit lengths of all candidates sum to $O(b)$. This allows us to test all candidates by exact multipoint evaluation in $\widetilde O(nb)$ bit operations.

math.NT · cs.DS · cs.SC

版本更新 · v3arXiv:2601.00312

Quantifier Elimination Meets Treewidth

Hao Wu, Jiyu Zhu, Amir Kafshdar Goharshady, Jie An, Bican Xia, Naijun Zhan

原文摘要

In this paper, we address the complexity barrier inherent in Fourier-Motzkin elimination (FME) and cylindrical algebraic decomposition (CAD) when eliminating a block of (existential) quantifiers. To mitigate this, we propose exploiting structural sparsity in the variable dependency graph of quantified formulas. Utilizing tools from parameterized algorithms, we investigate the role of treewidth, a parameter that measures the graph's tree-likeness, in the process of quantifier elimination. A novel dynamic programming framework, structured over a tree decomposition of the dependency graph, is developed for applying FME and CAD, and is also extensible to general quantifier elimination procedures. Crucially, we prove that when the treewidth is a constant, the framework achieves a significant exponential complexity improvement for both FME and CAD, reducing the worst-case complexity bound from doubly exponential to single exponential. Preliminary experiments on sparse linear real arithmetic (LRA) and nonlinear real arithmetic (NRA) benchmarks confirm that our algorithm outperforms the existing popular heuristic-based approaches on instances exhibiting low treewidth.

cs.LO · cs.CC · cs.SC

版本更新 · v2arXiv:2606.04858

Integer points close to a transcendental curve: an algorithmic approach

Nicolas Brisebarre, Guillaume Hanrot

原文摘要

In this article, we propose an algorithmic approach to determine the integer points located near a transcendental curve. This approach is closely related to a celebrated work by Bombieri and Pila and to the so-called Coppersmith's method. We establish the underlying theoretical foundations, prove the algorithms, study their complexity and present practical experiments; we also compare our approach with previously existing ones. From a practical point of view, we focus on an instance of our general problem, called the Table Maker's Dilemma, whose solving makes it possible to evaluate a given function with correct rounding. Our experiments show a significant speedup. In particular, our results show that the development of a correctly rounded mathematical library for the binary128 format is now possible at a much smaller cost than with previously existing approaches.

math.NT · cs.SC