Related papers: Algebraic Branching Programs, Border Complexity, a…

In the preprint arXiv:2511.07900 we proved that there exists a localizing ring $A_M$ for $A$ an associative ring with unit, and $M=\oplus_{i=1}^rM_i$ a direct sum of $r\geq 1$ simple right $A$-modules. For a homomorphism of associative…

A framework is developed to describe the Zariski topologies on the prime and primitive spectra of a quantum algebra $A$ in terms of the (known) topologies on strata of these spaces and maps between the collections of closed sets of…

We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension of the well-known size-change termination method.…

The method of partial derivatives is one of the most successful lower bound methods for arithmetic circuits. It uses as a complexity measure the dimension of the span of the partial derivatives of a polynomial. In this paper, we consider…

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) has recently been proposed, motivated by open questions about…

Backward propagation (BP) is widely used to compute the gradients in neural network training. However, it is hard to implement BP on edge devices due to the lack of hardware and software resources to support automatic differentiation. This…

We show that in a knapsack feasibility problem an integral vector $p$, which is short, and near parallel to the constraint vector gives a branching direction with small integer width. We use this result to analyze two computationally…

A k-gap is a finite k-sequence of pairwise disjoint monotone families of infinite subsets of N mixed in such a way that we cannot find a partition of N such that each family is trival on one piece of the partition. We prove that, relative…

In 2007, B. Poonen (unpublished) studied the $p$--adic closure of a subgroup of rational points on a commutative algebraic group. More recently, J. Bella\"iche asked the same question for the special case of Abelian varieties. These…

We provide a list of new natural $\mathsf{VNP}$-intermediate polynomial families, based on basic (combinatorial) $\mathsf{NP}$-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…

Understanding and controlling the informational complexity of neural networks is a central challenge in machine learning, with implications for generalization, optimization, and model capacity. While most approaches rely on entropy-based…

We classify group schemes in terms of their Cartier modules. We also prove the equivalence of different definitions of the tangent space and the dimension for these group schemes; in particular, the minimal dimension of a formal group law…

The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is one of the most famous of these problems. Given a set of…

Let A be an idempotent algebra on a finite domain. By mediating between results of Chen and Zhuk, we argue that if A satisfies the polynomially generated powers property (PGP) and B is a constraint language invariant under A (that is, in…

We study the maximum likelihood degree of linear concentration models in algebraic statistics. We relate the geometry of the reciprocal variety to that of semidefinite programming. We show that the Zariski closure in the Grassmanian of the…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…