Related papers: A Note on the Theoretical Support to Compute Dimen…
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the…
We prove a sharp upper bound for the projective dimension of ideals of height two generated by quadrics in a polynomial ring with arbitrary large number of variables.
This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…
In this note we investigate the connection between polylogarithms on curves and abelian schemes. The main result shows that the polylogarithm on the abelian scheme can be obtained as the push-forward of the polylogarithm on a suitable…
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the…
In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…
This is a contribution to the theory of atoms in abelian categories recently developed in a series of papers by Kanda. We present a method that enables one to explicitly compute the atom spectrum of the module category over a wide range of…
The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more…
This article makes the key observation that when using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is not always the signs of those polynomials that are of paramount importance but…
A polynomial ring with rational coefficients is an irreducible representation of Lie algebras of endomorphisms of exterior powers of a infinite countable dimensional $\mathbb{Q}$-vector space. We give an explicit description of it, using…
We describe an algorithm for computing a $\Q$-rational model for the quotient of a modular curve by an automorphism group, under mild assumptions on the curve and the automorphisms, by determining $q$-expansions for a basis of the…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
Motivated by applications in moduli theory, we introduce a flexible and powerful language for expressing lower bounds on relative dimension of morphisms of schemes, and more generally of algebraic stacks. We show that the theory is robust…
In this work we present some arithmetic properties of families of abelian $p$--extensions of global function fields, among which are their generators and their type of ramification and decomposition.
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number…
We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…
Subfield subcodes of algebraic-geometric codes are good candidates for the use in post-quantum cryptosystems, provided their true parameters such as dimension and minimum distance can be determined. In this paper we present new values of…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…