Related papers: On Reachability Problems for Low-Dimensional Matri…
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for the general model by considering only runs that are…
The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
We prove that all hierarchically hyperbolic spaces have finite asymptotic dimension and obtain strong bounds on these dimensions. One application of this result is to obtain the sharpest known bound on the asymptotic dimension of the…
We introduce and study a semigroup structure on the set of irreducible components of the Hurwitz space of marked coverings of a complex projective curve with given Galois group of the coverings and fixed ramification type. As application,…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
The paper has three parts. It is conjectured that for every elementary amenable group G and every non-zero commutative ring k, the homological dimension of G over k is equal to the Hirsch length of G whenever G has no k-torsion. In Part I…
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…
We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…
We consider the (extended) metaplectic representation of the semidirect product $\mathcal{G}={\mathbb H}^d\rtimes Sp(d,{\mathbb R})$ between the Heisenberg group and the symplectic group. Subgroups $H=\Sigma \rtimes D$, with $\Sigma$ being…
We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh…
Many-body wavefunctions usually lie in high-dimensional Hilbert spaces. However, physically relevant states, i.e, the eigenstates of the Schr\"odinger equation are rare. For many-body systems involving only pairwise interactions, these…
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
We present a quasipolynomial-time algorithm for solving the weak membership problem for the convex set of separable, i.e. non-entangled, bipartite density matrices. The algorithm decides whether a density matrix is separable or whether it…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
The reachable set of controlled dynamical systems consist of the set of all possible reachable states from an initial condition, over a certain period of time under various control and operation constraints and exogenous disturbances. For…
Given a Hecke symmetry $R$, one can define a matrix bialgebra $E_R$ and a matrix Hopf algebra $H_R$, which are called function rings on the matrix quantum semi-group and matrix quantum groups associated to $R$. We show that for an even…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
In this paper we prove that the homological dimension of an elementary amenable group over an arbitrary commutative coefficient ring is either infinite or equal to the Hirsch length of the group. Established theory gives simple group…
We give an affirmative answer to the Grunwald problem for new families of non-solvable finite groups G, away from the set of primes dividing |G|. Furthermore, we show that such G verify the condition (BM), that is, the Brauer-Manin…