English
Related papers

Related papers: Computing transcendence and linear relations of 1-…

200 papers

Combining results from Keller and Buchweitz, we describe the 1-periodic derived category of a finite dimensional algebra $A$ of finite global dimension as the stable category of maximal Cohen-Macaulay modules over some Gorenstein algebra…

Representation Theory · Mathematics 2025-06-25 Joseph Winspeare

We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…

Rings and Algebras · Mathematics 2025-08-01 Murray R. Bremner , Juana Sánchez-Ortega

The sum of elliptic integrals simultaneously determines orbits in thr Kepler problem and the addition of divisors on elliptic curves. Periodic motion of a body in physical space is defined by symmetries, whereas periodic motion of divisors…

Exactly Solvable and Integrable Systems · Physics 2019-09-04 A. V. Tsiganov

A tautological system, introduced in [16][17], arises as a regular holonomic system of partial differential equations that govern the period integrals of a family of complete intersections in a complex manifold $X$, equipped with a suitable…

Algebraic Geometry · Mathematics 2014-10-28 An Huang , Bong H. Lian , Xinwen Zhu

We describe all special curves in the parameter space of complex cubic polynomials, that is all algebraic irreducible curves containing infinitely many post-critically finite polynomials. This solves in a strong form a conjecture by Baker…

Dynamical Systems · Mathematics 2016-06-21 Charles Favre , Thomas Gauthier

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Logic in Computer Science · Computer Science 2026-05-15 Mishel Carelli

The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…

Logic in Computer Science · Computer Science 2019-07-16 Andrea Condoluci , Beniamino Accattoli , Claudio Sacerdoti Coen

The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…

Computational Complexity · Computer Science 2015-11-17 Anthony Widjaja Lin , Sanming Zhou

From a well-known equation of Hardy, one can derive a simple linear combination of the Euler-Mascheroni constant ($\gamma=0.577215\ldots$) and Euler-Gompertz constant ($\delta=0.596347\ldots$): $\gamma+\delta/e=\textrm{Ein}\left(1\right)$.…

Number Theory · Mathematics 2025-10-02 Michael R. Powers

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

Symbolic Computation · Computer Science 2025-04-15 Iago Leal de Freitas , Júlia Mota , João Paixão , Lucas Rufino

It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…

Symbolic Computation · Computer Science 2024-06-18 Bertrand Teguia Tabuguia , James Worrell

We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…

Quantum Physics · Physics 2019-03-14 Pablo Arrighi , Gilles Dowek

In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…

Symbolic Computation · Computer Science 2024-10-23 Hamid Rahkooy

Two fundamental issues about the relation between the deformed Heisenberg-Weyl algebra in noncommutative space and the undeformed one in commutative space are elucidated. First the un-equivalency theorem between two algebras is proved: the…

High Energy Physics - Theory · Physics 2009-11-11 Jian-Zu Zhang

This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…

Systems and Control · Electrical Eng. & Systems 2021-12-07 Biqiang Mu , Tianshi Chen , Changming Cheng , Er-Wei Bai

By employing the theory of vector-valued automorphic forms for non-unitarizable representations, we provide a new bound for the number of linear relations with algebraic coefficients between the periods of an algebraic Riemann surface with…

Algebraic Geometry · Mathematics 2018-12-18 Luca Candelori , Jack Fogliasso , Christopher Marks , Skip Moses

Nonlinear second-order ordinary differential equations are common in various fields of science, such as physics, mechanics and biology. Here we provide a new family of integrable second-order ordinary differential equations by considering…

Exactly Solvable and Integrable Systems · Physics 2020-10-28 Dmitry Sinelshchikov

We study the problem of addition and subtraction using the Zeckendorf representation of integers. We show that both operations can be performed in linear time; in fact they can be performed by combinational logic networks with linear size…

Data Structures and Algorithms · Computer Science 2012-07-20 Connor Ahlbach , Jeremy Usatine , Nicholas Pippenger

In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…

Number Theory · Mathematics 2025-10-02 Yagub N. Aliyev

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

Logic · Mathematics 2024-11-28 A. L. Semenov , S. F. Soprunov