Related papers: Detecting integral polyhedral functions

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

We show that the commutator relations in the refined tropical vertex group can be expressed via the enumeration of suitable real rational curves in toric surfaces.

Polytropes are both ordinary and tropical polytopes. We show that tropical types of polytropes in $\mathbb{TP}^{n-1}$ are in bijection with cones of a certain Gr\"{o}bner fan $\mathcal{GF}_n$ in $\mathbb{R}^{n^2 - n}$ restricted to a small…

In this paper, a new identity for convex functions is derived. A consequence of the identity is that we can derive new estimates for the remainder term of the midpoint, trapezoid, and Simpson formulae for functions whose derivatives in…

We show that differentiable functions, defined on a convex body $K \subseteq \mathbb R^d$, whose derivatives do not exceed a suitable given sequence of positive real numbers share many properties with polynomials. The role of the degree of…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

For a tropical prevariety $V\subset \RR^n$ (being a finite union of rational polyhedra) we define a tropical Hilbert function $TH_V(k)$ to be the maximal number of tropically independent on $V$ among tropical monomials with degrees at most…

The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by…

Deep neural networks show great success when input vectors are in an Euclidean space. However, those classical neural networks show a poor performance when inputs are phylogenetic trees, which can be written as vectors in the tropical…

Here we introduce a way to construct generalized trigonometric functions associated with any complex polynomials, and the well known trigonometric functions can be seen to associate with polynomial $x^2-1$. We will show that those…

Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…

The goal of this note is to bring attention to an interesting family of rings: the rings of $\mathbb Z$-valued functions on $\mathbb Z$ and, more generally, infinite subsets of $\mathbb Z$ whose restrictions to all finite sets are given by…

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

Tropical implicitization means computing the tropicalization of a unirational variety from its parametrization. In the case of a hypersurface, this amounts to finding the Newton polytope of the implicit equation, without computing its…

We study some basic algorithmic problems concerning the intersection of tropical hypersurfaces in general dimension: deciding whether this intersection is nonempty, whether it is a tropical variety, and whether it is connected, as well as…

Tropical Newton-Puiseux polynomials defined as piece-wise linear functions with rational coefficients at the variables, play a role of tropical algebraic functions. We provide explicit formulas for tropical Newton-Puiseux polynomials being…

Let $T\colon X\to X$ be a bounded operator on Banach space, whose spectrum $\sigma(T)$ is included in the closed unit disc $\overline{\mathbb D}$. Assume that the peripheral spectrum $\sigma(T)\cap{\mathbb T}$ is finite and that $T$…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

Convex regression is the problem of fitting a convex function to a data set consisting of input-output pairs. We present a new approach to this problem called spectrahedral regression, in which we fit a spectrahedral function to the data,…