Related papers: Toric Intersection Theory for Affine Root Counting
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain…
Following the definition of a root basis of an affine root system, we define a base of the root system of an affine Lie superalgebra to be a linearly independent subset $B$ of its root system such that each root can be written as a linear…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…
An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…
We compute the Cox ring of an embedded variety $X \subseteq Z$ within a Mori dream space, under the assumption that the pullback map induces an isomorphism at the level of divisor class groups. We show that the Cox ring of $X$ is the…
We propose a generalization of tropical curves by dropping the rationality and integrality requirements while preserving the balancing condition. An interpretation of such curves as critical points of a certain quadratic functional allows…
For a $t$-nomial $f(x) = \sum_{i = 1}^t c_i x^{a_i} \in \mathbb{F}_q[x]$, we show that the number of distinct, nonzero roots of $f$ is bounded above by $2 (q-1)^{1-\varepsilon} C^\varepsilon$, where $\varepsilon = 1/(t-1)$ and $C$ is the…
We introduce a unified theory of Cartan subgroups and maximal toroids - defined as connected multiplicative type subgroups that are maximal amongst all such subgroups - which holds for all affine algebraic groups over a field, regardless of…
We show, under some natural conditions, that the set of abelian points on the non-anomalous subset of a closed irreducible subvariety $X$ intersected with the union of connected algebraic subgroups of codimension at least $\dim X$ in a…
We provide a partial answer to the following problem: \emph{give an effective upper bound on the multiplicity of non-isolated common zero of a tuple of Noetherian functions}. More precisely, consider a foliation defined by two commuting…
We analyze the expansions in terms of the approximate roots of a Weierstrass polynomial $f$ defining a plane branch $(C,0)$, in the light of the toric embedded resolution of the branch. This leads to the definition of a class of (non…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit algorithm for computing the multiplicities…
We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these…
A subspace arrangement is a finite collection of affine subspaces in $\mathbb{R}^n$. One of the main problems associated to arrangements asks up to what extent the topological invariants of the union of these spaces, and of their complement…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
The notion of a "root base" together with its geometry plays a crucial role in the theory of finite and affine Lie theory. However, it is known that such a notion does not exist for the recent generalizations of finite and affine root…