Related papers: Algebraic Closure of Matrix Sets Recognized by 1-V…
Let $F$ be a field, let $D$ be a subring of $F$, and let ${\mathfrak{X}}$ be the Zariski-Riemann space of valuation rings containing $D$ and having quotient field $F$. We consider the Zariski, inverse and patch topologies on…
We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the…
This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…
The commutative ambiguity of a context-free grammar G assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton's method to…
In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…
We define Lie subalgebras of the group algebra of a finite pseudo-reflection group that are involved in the definition of the Cherednik KZ-systems, and determine their structure. We provide applications for computing the Zariski closure of…
A noncommutative analogue of the Zariski cancellation problem asks whether $A[x]\cong B[x]$ implies $A\cong B$ when $A$ and $B$ are noncommutative algebras. We resolve this affirmatively in the case when $A$ is a noncommutative finitely…
We prove that the closure (for the Zariski topology) of the set of polynomial automorphisms of the complex affine plane whose polydegree is (cd-1,b,a) contains all triangular automorphisms of degree cd+a, where a,b >1 and c>0 are integers…
We investigate the termination problem of a family of multi-path polynomial programs (MPPs), in which all assignments to program variables are polynomials, and test conditions of loops and conditional statements are polynomial equalities.…
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
We consider the finiteness problem for central configurations of the $n-$body problem. We prove that, for $n\geq4$, there exists a (Zariski) closed subset $B$ in the mass space $\mathbb{R}^{n}$, such that if $(m_1,...,m_n) \in…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
We study the language universality problem for One-Counter Nets, also known as 1-dimensional Vector Addition Systems with States (1-VASS), parameterized either with an initial counter value, or with an upper bound on the allowed counter…
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff…
We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…