Related papers: Algebraic Closure of Matrix Sets Recognized by 1-V…
Let $R$ be the ring of $S$-integers in a number field $K$. Let $\mathcal{B}=\{\beta, \beta^{\ast}\}$ be the multi-set of roots of a nonzero quadratic polynomial over $R$. There are varieties $V(\mathcal{B})_{N,k}$ defined over $R$…
Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski…
We show that the Zariski closure of the set of hypersurfaces of degree $M$ in ${\mathbb P}^{M}$, where $M\geq 5$, which are either not factorial or not birationally superrigid, is of codimension at least $\binom{M-3}{2}+1$ in the parameter…
We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose…
Tiwari proved that termination of linear programs (loops with linear loop conditions and updates) over the reals is decidable through Jordan forms and eigenvectors computation. Braverman proved that it is also decidable over the integers.…
We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification…
Any scheme has its associated little and big Zariski toposes. These toposes support an internal mathematical language which closely resembles the usual formal language of mathematics, but is "local on the base scheme": For example, from the…
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…
We characterize the Zariski topologies over an algebraically closed field in terms of general dimension-theoretic properties. Some applications are given to complex manifold and to strongly minimal sets.
A computation shows that there are 77 (up to scalar shifts) possible pairs of integer coefficient polynomials of degree five, having roots of unity as their roots, and satisfying the conditions of Beukers and Heckman [1], so that the…
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…
Testing whether a set $\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebraic independence testing question is wide open over finite…
In this text we prove that if X is a reduced non-archimedean analytic space and f is a analytic function on a dense Zariski-open subspace of X whose zero-locus is closed in X, then f is a meromorphic function on X. As a corollary, we deduce…
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are…
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…
Given a finite set $W$ in $\bar{k}^n$ where $\bar{k}$ is the algebraic closure of a field $k$ one would like to determine if $W$ can be decomposed as $\prod_{i=1}^n V_i$ where $V_i \subset \bar{k}$ under a linear transformation, that is,…
We present the first scalable bound analysis that achieves amortized complexity analysis. In contrast to earlier work, our bound analysis is not based on general purpose reasoners such as abstract interpreters, software model checkers or…