Related papers: Integer Complexity Generalizations in Various Ring…
The (Mahler-Popken) complexity $\| n \|$ of a natural number $n$ is the smallest number of ones that can be used via combinations of multiplication and addition to express $n$, with parentheses arranged in such a way so as to form legal…
A method is provided for computing an upper bound of the complexity of a module over a local ring, in terms of vanishing of certain cohomology modules. We then specialize to complete intersections, which are precisely the rings over which…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
Let $R$ be a local ring and $M,N$ be finitely generated $R$-modules. The complexity of $(M,N)$, denoted by $\cxx RMN$, measures the polynomial growth rate of the number of generators of the modules $\Ext nRMN$. In this paper we study…
We define a notion of complexity for modules over infinite groups. We show that if $M$ is a module over the group ring $kG$, and $M$ has complexity $\leq f$ (where $f$ is some complexity function) over some set of finite index subgroups of…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…
We consider the sensitivity of real roots of polynomial systems with respect to perturbations of the coefficients. In particular - for a version of the condition number defined by Cucker, Krick, Malajovich, and Wschebor - we establish new…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
The complexity $f(n)$ of an integer was introduced in 1953 by Mahler & Popken: it is defined as the smallest number of $1$'s needed in conjunction with arbitrarily many +, * and parentheses to write an integer $n$ (for example, $f(6) \leq…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…
Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity $IO_\mathcal{A}\left(n,M\right)$ of a general class of hybrid algorithms computing the product of two integers, each represented with $n$ digits in a…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…
The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…