Related papers: Algebraic and Arithmetic Attributes of Hypergeomet…
We formulate and prove a combinatorial criterion to decide if an A-hypergeometric system of differential equations has a full set of algebraic solutions or not. This criterion generalises the so-called interlacing criterion in the case of…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
We give a combinatorial interpretation for the hypergeometric functions associated with tuples of rational numbers.
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
We study the arithmetic property which allows to sharpen number-theoretic estimates. Previous results on this property are, as a rule, quantitive. The application of our general qualitive theorems to generalized hypergeometric functions…
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…
The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In this position paper, we promote the study of function spaces parameterized by machine learning models through the lens of algebraic geometry. To this end, we focus on algebraic models, such as neural networks with polynomial activations,…
We develop basic notions and methods of algebraic geometry over the algebraic objects called hyperrings. Roughly speaking, hyperrings generalize rings in such a way that an addition is `multi-valued'. This paper largely consisits of two…
We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…
We generalize the known constructions of A-hypergeometric functions. In particular, we show that periods of middle dimension on affine or projective complex algebraic varieties are A-hypergeometric functions of coefficients of polynomial…
Our Chapter in the upcoming Volume I: Computer Science and Software Engineering of Computing Handbook (Third edition), Allen Tucker, Teo Gonzales and Jorge L. Diaz-Herrera, editors, covers Algebraic Algorithms, both symbolic and numerical,…
We introduce FlagAlgebraToolbox, an extension of SageMath capable of automating flag algebra calculations and optimizations. FlagAlgebraToolbox has a simple interface, can handle a wide range of combinatorial theories, can numerically…
In the last decade major steps towards an algorithmic treatment of orthogonal polynomials and special functions (OP & SF) have been made, notably Zeilberger's brilliant extension of Gosper's algorithm on algorithmic definite hypergeometric…
A new type of algorithms is presented that combine the advantages of quantum and classical ones. Those combined advantages along with aspects of Geometric Algebra that open possibilities unavailable to both of these computations are…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
We give an overview of some of the main results from the theories of hypergeometric and basic hypergeometric series and integrals associated with root systems. In particular, we list a number of summations, transformations and explicit…