Related papers: A parameterized linear formulation of the integer …

There has been significant recent interest in understanding the dependence on the wavenumber, $k$, of boundary integral operators (BIOs), supported on some set $\Gamma\subset \mathbb{R}^n$, that arise in the solution of BVPs for the…

For convex sets $K$ and $L$ in ${\mathbb{R}}^d$ we define $R_L(K)$ to be the convex hull of all points belonging to $K$ but not to the interior of $L$. Cutting-plane methods from integer and mixed-integer optimization can be expressed in…

We connect generalized permutahedra with Schubert calculus. Thereby, we give sufficient vanishing criteria for Schubert intersection numbers of the flag variety. Our argument utilizes recent developments in the study of Schubitopes, which…

Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $\max\{c^\top x \colon A x = b,\, x \in \mathbb{Z}^n_{\geq 0}\}$, where all the entries of $A,b,c$ are integer, parameterized by the…

Let ${\mathcal H}$ be a complex Hilbert space and let ${\mathcal B}({\mathcal H})$ be the algebra of all bounded linear operators on ${\mathcal H}$. For a positive integer $k$ less than the dimension of ${\mathcal H}$ and ${\mathbf A} =…

We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…

We consider the class of (possibly) infinite metric spaces with integer-valued totally split-decomposable metric and possessing an injective hull which has the structure of a polyhedral complex. For this class, we give a characterization…

Let $R$ be a standard graded Noetherian algebra over an infinite field $K$ and $M$ a finitely generated $\mathbb{Z}$-graded $R$-module. Then for any graded ideal $I\subseteq R_+$ of $R$, we show that there exist integers $e_1\geq e_2$ such…

A long standing question in the theory of orthogonal matrix polynomials is the matrix Bochner problem, the classification of $N \times N$ weight matrices $W(x)$ whose associated orthogonal polynomials are eigenfunctions of a second order…

Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants…

We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…

For $n\in \mathbb{N}$, let $Y_n$ denote the linear span of the first $n+1$ levels of the Haar system in a Haar system Hardy space $Y$ (this class contains all separable rearrangement-invariant function spaces and also related spaces such as…

A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…

The Conley-Zehnder index associates an integer to any continuous path of symplectic matrices starting from the identity and ending at a matrix which does not admit 1 as an eigenvalue. We give new ways to compute this index. Robbin and…

Consider the infinite dimensional flag manifold $LK/T$ corresponding to the simple Lie group $K$ of rank $l$ and with maximal torus $T$. We show that, for $K$ of type $A$, $B$ or $C$, if we endow the space $H^*(LK/T)\otimes…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

In the present paper, motivated by a conjecture of Jahan and Zheng, we prove that componentwise polymatroidal ideals have linear quotients. This solves positively a conjecture of Bandari and Herzog.

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n vertices. A time-graph of order n is given by a subset of the…

In this paper, we consider the counting function $E_P(y) = |P_{y} \cap Z^{n_x}|$ for a parametric polyhedron $P_{y} = \{x \in R^{n_x} \colon A x \leq b + B y\}$, where $y \in R^{n_y}$. We give a new representation of $E_P(y)$, called a…