Related papers: Solving Polynomial Systems in the Cloud with Polyn…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…
In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Many applications require comparing multimodal data with different structure and dimensionality that cannot be compared directly. Recently, there has been increasing interest in methods for learning and efficiently representing such…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…
Combinig the harmonic balance method (HBM) and a continuation method is a well-known technique to follow the periodic solutions of dynamical systems when a control parameter is varied. However, since deriving the algebraic system containing…
Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
In arXiv:1208.0365 entanglement polytopes where introduced as a coarsening of the SLOCC classification of multipartite entanglement. The advantages of classifying entanglement by entanglement polytopes are a finite hierarchy for all…
We introduce the Cox homotopy algorithm for solving a sparse system of polynomial equations on a compact toric variety $X_\Sigma$. The algorithm lends its name from a construction, described by Cox, of $X_\Sigma$ as a GIT quotient $X_\Sigma…
We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.