Related papers: Generalization of Kuratowski problem in linear spa…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We investigate the combinatorics of max-pooling layers, which are functions that downsample input arrays by taking the maximum over shifted windows of input coordinates, and which are commonly used in convolutional neural networks. We…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…
Recent research has proposed neural architectures for solving combinatorial problems in structured output spaces. In many such problems, there may exist multiple solutions for a given input, e.g. a partially filled Sudoku puzzle may have…
Label the vertices of the complete graph $K_v$ with the integers $\{ 0, 1, \ldots, v-1 \}$ and define the length of the edge between $x$ and $y$ to be $\min( |x-y| , v - |x-y| )$. Let $L$ be a multiset of size $v-1$ with underlying set…
We continue to investigate cases when the Repov\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces.…
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the supremum (least upper bound) of the distances of contained…
In finitely-dimensional spaces the sum range of a series has to be an affine subspace. It is long known this is not the case in infinitely dimensional Banach spaces. In particular in 1984 M.I. Kadets and K. Wo\`{z}niakowski obtained an…
$\mathbb B$-convexity was defined in [7] as a suitable Kuratowski-Painlev\'e upper limit of linear convexities over a finite dimensional Euclidean vector space. Excepted in the special case where convex sets are subsets of $\mathbb R^n_ +$,…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
We present a new algebraic algorithmic scheme to solve {\em convex integer maximization} problems of the following form, where $c$ is a convex function on $R^d$ and $w_1x,...,w_dx$ are linear forms on $R^n$, $$\max \{c(w_1 x,...,w_d x):…
Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…
Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…
We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…