Related papers: Parametric Presburger arithmetic: logic, combinato…

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…

Modify the Blum-Shub-Smale model of computation replacing the permitted computational primitives (the real field operations) with any finite set $B$ of real functions semialgebraic over the rationals. Consider the class of boolean decision…

For a permutation $u\in S_n$, let $N\ast u\in S_{Nn}$ be the permutation with scaled Lehmer code. For given $u,v,w\in S_n$ and integer $N$, the stretched Schubert coefficients are defined as $f_{u,v,w}(N):=c_{N*u,N*v}^{N*w}$. Our main…

For a wide family of formations $\mathfrak{F}$ (which includes Baer-local formations) it is proved that the $ \mathfrak{F}$-hypercenter of a permutation finite group can be computed in polynomial time. In particular, the algorithms for…

We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…

The goal of this paper is to undertake an in-depth study of the phenomenon behind the Furstenberg--S\'ark\"ozy theorem, which, in its modern form due to Kamae and Mend\`es-France, states that if $E$ is a set of integers with positive…

We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…

Let $P(b)\subset R^d$ be a semi-rational parametric polytope, where $b=(b_j)\in R^N$ is a real multi-parameter. We study intermediate sums of polynomial functions $h(x)$ on $P(b)$, $$ S^L (P(b),h)=\sum_{y}\int_{P(b)\cap (y+L)} h(x) \mathrm…

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form $$P = \sum_{i = 1}^T \prod_{j = 1}^d Q_{ij}$$ such that each $Q_{ij}$ is an…

We investigate quasi-Newton methods for minimizing a strictly convex quadratic function which is subject to errors in the evaluation of the gradients. The methods all give identical behavior in exact arithmetic, generating minimizers of…

Recently, M. Kompatscher proved that for each finite supernilpotent algebra $\mathbf{A}$ in a congruence modular variety, there is a polynomial time algorithm to solve polynomial equations over this algebra. Let $\mu$ be the maximal arity…

We introduce and study a generalization $s_{(\mu|\lambda)}$ of the Schur functions called the almost symmetric Schur functions. These functions simultaneously generalize the finite variable key polynomials and the infinite variable Schur…

A new bi-parametric $su(1,1)$ algebraization of the Heun class of equations is explored. This yields additional quasi-polynomial solutions of the form $\{z^{\alpha}P_N(z): \ \alpha \in \mathbb{C}, \ N \in \mathbb{N}_0\}$ to the General Heun…

The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number $\varphi_R(n)$, possibly infinite, of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…

This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a denominator of the form $G(z,t)=P(t)+zt^{r}$, where the zeros of $P$ are positive and real. We show that every member of…

The cyclic group labeled family of quasi-projection operators is used for investigation of decomposition of functions with respect to the cyclic group of order n . Series of new identities thus arising are demonstrated and new perspectives…

Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…

We investigate expansions of Presburger arithmetic, i.e., the theory of the integers with addition and order, with additional structure related to exponentiation: either a function that takes a number to the power of $2$, or a predicate for…

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…

We study the regularity of the roots of multiparameter families of complex univariate monic polynomials $P(x)(z) = z^n + \sum_{j=1}^n (-1)^j a_j(x) z^{n-j}$ with fixed degree $n$ whose coefficients belong to a certain subring $\mathcal C$…