Related papers: Polyominoes with nearly convex columns: A model wi…

Differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides in R^n are studied. Under a weakened monotonicity-type condition the existence of solutions is proved.

This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded convex domains or convex rings. Constant boundary conditions are imposed on the single component of the boundary when the domain…

In this paper we show that a quasi-exactly solvable (normalizable or periodic) one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. In…

In this article we prove new results about the existence of 2-cells in disc diagrams which are extreme in the sense that they are attached to the rest of the diagram along a small connected portion of their boundary cycle. In particular, we…

We give explicit polynomial-sized (in $n$ and $k$) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree $k$ in $n$ variables. These convex cones form a family of…

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…

We define fully exact module categories, a subclass of exact module categories over a finite braided tensor category that is stable under the relative Deligne product. In contrast, we demonstrate with examples in both zero and non-zero…

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

Under appropriate assumptions, we show that all bounded entire solutions to a class of semilinear elliptic systems are confined in a convex domain. Moreover, we prove a Liouville type theorem in the case where the domain is strictly convex.…

To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

In this article we construct many examples of properly convex irreducible domains divided by Zariski dense relatively hyperbolic groups in every dimension at least 3. This answers a question of Benoist. Relative hyperbolicity and non-strict…

This paper presents a novel convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems with non-convex constraints that restrict the…

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…