Related papers: Pebble Minimization of Polyregular Functions

Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…

The regularity of refinable functions has been analysed in an extensive literature and is well-understood in two cases: 1) univariate 2) multivariate with an isotropic dilation matrix. The general (non-isotropic) case offered a great…

In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…

Given a regular language L over an ordered alphabet $\Sigma$, the set of lexicographically smallest (resp., largest) words of each length is itself regular. Moreover, there exists an unambiguous finite-state transducer that, on a given word…

An integral quadratic polynomial is called regular if it represents every integer that is represented by the polynomial itself over the reals and over the $p$-adic integers for every prime $p$. It is called complete if it is of the form…

Neural codes, represented as collections of binary strings called codewords, are used to encode neural activity. A code is called convex if its codewords are represented as an arrangement of convex open sets in Euclidean space. Previous…

In this note we consider $k$-regular multigraphs, where the possible edge multiplicities are controlled. These structures are considered in a question recently posed by Brendan McKay. We express the generating functions using the scalar…

Peter McMullen has developed a theory of realizations of abstract regular polytopes, and has shown that the realizations up to congruence form a pointed convex cone which is the direct product of certain irreducible subcones. We show that…

We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of…

Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…

This paper establishes an analogue of the special chain theorem for the embedding dimension of polynomial rings, with direct application on the (embedding) codimension. In particular, we recover a classic result on the transfer of…

In this paper we prove that if (u, K) is an almost-minimizer of the Griffith functional and K is $\epsilon$-close to a plane in some ball B $\subset$ R N while separating the ball B in two big parts, then K is C 1,$\alpha$ in a slightly…

We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…

For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…

We develop a framework for dealing with smooth approximations to billiards with corners in the two-dimensional setting. Let a polygonal trajectory in a billiard start and end up at the same billiard's corner point. We prove that smooth…

We single out some problems of Schubert calculus of subspaces of codimension 2 that have the property that all their solutions are real provided that the data are real. Our arguments explore the connection between subspaces of codimension 2…