Related papers: Algebraic Closure of Matrix Sets Recognized by 1-V…

We develop the affine sieve in the context of orbits of congruence subgroups of semi-simple groups acting linearly on affine space. In particular we give effective bounds for the saturation numbers for points on such orbits at which the…

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

In this article, we shall discuss the solution to the Zariski Cancellation Problem in positive characteristic, various approaches taken so far towards the possible solution in characteristic zero, and several other questions related to this…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

Let $X$ be an irreducible algebraic variety over $\mathbb{C}$, endowed with an algebraic foliation ${\cal{F}}$. In this paper, we introduce the notion of minimal invariant variety $V({\cal{F}},Y)$ with respect to $({\cal{F}},Y)$, where $Y$…

This is an expanded version of the talk by the author at the conference Polynomial Rings and Affine Algebraic Geometry, February 12--16, 2018, Tokyo Metropolitan University, Tokyo, Japan. Considering a local version of the Zariski…

The termination problem for affine programs over the integers was left open in\cite{Braverman}. For more that a decade, it has been considered and cited as a challenging open problem. To the best of our knowledge, we present here the most…

We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an abstraction of the language L(A): its…

Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…

We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix.…

Let P^n denote the n-dimensional projective space defined over the algebraic closure of a finite field F_q, let V contained P^n be a complete intersection defined over F_q of dimension r and singular locus of dimension at most s, and let…

We discuss different generalizations of Zariski decomposition, relations between them and connections with finite generation of divisorial algebras.

Recently, the authors have proved the finiteness of common zeros of two iterated rational maps under some compositional independence assumptions. In this article, we advance towards a question of Hsia and Tucker on a Zariski non-density of…

When $E$ is an $R$-module over a commutative unital ring $R$, the Zariski closure of its support is of the form $\mathrm V(\mathcal O(E))$ where $\mathcal O(E)$ is a unique radical ideal. We give an explicit form of $\mathcal O(E)$ and…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and total size 2^{O(k^2 log n)}, i.e., polynomial for all fixed k…

We prove that every unconditionally closed subset of a free group is algebraic, thereby answering affirmatively a 76 years old problem of Markov for free groups. In modern terminology, this means that Markov and Zariski topologies coincide…

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…