Related papers: Refutations of pebble minimization via output lang…
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…
We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory. The coKleisli category of the pebbling comonad specifies equivalences under different…
Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…
A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be…
A Stein manifold X is called S-parabolic if it possesses a plurisub- harmonic exhaustion function p that is maximal outside a compact subset of X: In analogy with (Cn; ln jzj), one defines the space of polynomials on a S- parabolic manifold…
We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
The prefix palindromic length $p_{\mathbf{u}}(n)$ of an infinite word $\mathbf{u}$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $\mathbf{u}$. This function is surprisingly difficult to…
We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…
For each $k\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\mathbb{F}_2^n$…
Polynomial functions have plenty of useful analytical properties, but they are rarely used as learning models because their function class is considered to be restricted. This work shows that when trained properly polynomial functions can…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. It is a fundamental model of graph reconfiguration and is…
We show that the local Burkholder functional $\mathcal B_K$ is quasiconvex. In the limit of $p$ going to 2 we find a class of non-polyconvex functionals which are quasiconvex on the set of matrices with positive determinant. In order to…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…