English
Related papers

Related papers: Refutations of pebble minimization via output lang…

200 papers

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…

Optimization and Control · Mathematics 2019-12-17 Tareq Hamadneh , Hassan Al-Zoubi , Mohammad Al-Qudah , Amjed Zraiqat

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…

Optimization and Control · Mathematics 2014-11-06 Robert Nishihara , Stefanie Jegelka , Michael I. Jordan

Deterministic two-way transducers define the robust class of regular functions which is, among other good properties, closed under composition. However, the best known algorithms for composing two-way transducers cause a double exponential…

Formal Languages and Automata Theory · Computer Science 2017-02-24 Luc Dartois , Paulin Fournier , Ismaël Jecker , Nathan Lhote

Letter-to-letter transducers are a standard formalism for modeling reactive systems. Often, two transducers that model similar systems differ locally from one another, by behaving similarly, up to permutations of the input and output…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Antonio Abu Nassar , Shaull Almagor

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…

Optimization and Control · Mathematics 2014-05-08 Jon Lee , Shmuel Onn , Lyubov Romanchuk , Robert Weismantel

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

Number Theory · Mathematics 2015-06-02 Patrick Cegielski , Serge Grigorieff , Irene Guessarian

A deep neural network using rectified linear units represents a continuous piecewise linear (CPWL) function and vice versa. Recent results in the literature estimated that the number of neurons needed to exactly represent any CPWL function…

Machine Learning · Computer Science 2023-01-18 Kuan-Lin Chen , Harinath Garudadri , Bhaskar D. Rao

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

Let $k\in \mathbb{N}\setminus\{0\}$. For a commutative ring $R$, the ring of dual numbers of $k$ variables over $R$ is the quotient ring $R[x_1,\ldots,x_k]/ I $, where $I$ is the ideal generated by the set $\{x_ix_j\mid i,j=1,\ldots,k\}$.…

Commutative Algebra · Mathematics 2022-07-22 A. A. A. Al-Maktry

Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a graph is the least…

Combinatorics · Mathematics 2024-12-02 Jonad Pulaj , Kenan Wood , Carl Yerger

We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , Filip Mazowiecki

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…

Combinatorics · Mathematics 2007-05-23 Andrzej Czygrinow , Glenn Hurlbert

The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…

High Energy Physics - Phenomenology · Physics 2007-05-23 Sanjay K. Ghosh , Sibaji Raha

We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…

Combinatorics · Mathematics 2020-11-25 Stavros Kousidis

Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…

Rings and Algebras · Mathematics 2007-05-23 A. P. Petravchuk , O. G. Iena

We study the ring of polyfunctions over $\mathbb Z/n\mathbb Z$. The ring of polyfunctions over a commutative ring $R$ with unit element is the ring of functions $f:R\to R$ which admit a polynomial representative $p\in R[x]$ in the sense…

Combinatorics · Mathematics 2022-11-17 Ernst Specker , Norbert Hungerbühler , Micha Wasem

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

Optimization and Control · Mathematics 2015-04-16 Amir Ali Ahmadi , Raphael Jungers

In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…

Functional Analysis · Mathematics 2026-05-06 Harmanus Batkunde , Muh. Nur , Al Azhary Masta , Meilin Imelda Tilukay

The functions satisfying the mean value property for an n-dimensional cube are determined explicitly. This problem is related to invariant theory for a finite reflection group, especially to a system of invariant differential equations.…

Combinatorics · Mathematics 2011-10-26 Katsunori Iwasaki

Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…

Optimization and Control · Mathematics 2024-06-05 Gilles Bareilles , Johannes Aspman , Jiri Nemecek , Jakub Marecek