Related papers: The Linear Ordering Polytope via Representations

A new representation of the next to leading QCD corrections to the nucleon structure functions is given in terms of parton distributions. All $~\alpha_{s}~$ corrections to the leading logarithmic approximation (LLA) are included. In…

We discuss representations of the projective line over a ring $R$ with 1 in a projective space over some (not necessarily commutative) field $K$. Such a representation is based upon a $(K,R)$-bimodule $U$. The points of the projective line…

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

The n-dimensional projective group gives rise to a one-parameter family of inhomogeneous first-order differential operator representations of sl(n+1). By partially swapping differential operators and multiplication operators, we obtain more…

We show that every 2nd order ODE defines a 4-parameter family of projective connections on its 2-dimensional solution space. In a special case of ODEs, for which a certain point transformation invariant vanishes, we find that this family of…

The article proposes an n-dimensional mathematical model of the visual representation of a linear programming problem. This model makes it possible to use artificial neural networks to solve multidimensional linear optimization problems,…

The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…

A Coxeter $n$-orbifold is an $n$-dimensional orbifold based on a polytope with silvered boundary facets. Each pair of adjacent facets meet on a ridge of some order $m$, whose neighborhood is locally modeled on ${\mathbb R}^n$ modulo the…

Tonks' projection from the permutohedron to the associahedron and the Loday--Ronco map both send permutations to planar binary trees. We give a syntactic account of these maps in the equational calculus of the free non-symmetric, non-unital…

Let $\{P_n \}_{n\ge0}$ be a sequence of monic orthogonal polynomials with respect to a quasi--definite linear functional $u$ and $\{Q_n \}_{n\ge0}$ a sequence of polynomials defined by $$Q_n(x)=P_n(x)+s_n P_{n-1}(x)+t_n P_{n-2}(x),\quad…

Let $(P_n)_n$ and $(Q_n)_n$ be two sequences of monic polynomials linked by a type structure relation such as $$ Q_{n}(x)+r_nQ_{n-1}(x)=P_{n}(x)+s_nP_{n-1}(x)+t_nP_{n-2}(x)\;, $$ where $(r_n)_n$, $(s_n)_n$ and $(t_n)_n$ are sequences of…

Let $BQP(n)$ be a boolean quadric polytope, $LOP(m)$ be a linear ordering polytope. It is shown that $BQP(n)$ is linearly isomorphic to a face of $LOP(2n)$.

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

For a directed polytope, we construct a colored operad whose Poincare-Hilbert series encodes certain operations on the cellular complex of the polytope. We conjecture that for a class of short polytopes the constructed operads are Koszul…

The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…

Informally, the 'linear representation hypothesis' is the idea that high-level concepts are represented linearly as directions in some representation space. In this paper, we address two closely related questions: What does "linear…

Let $n$ be the order of a (quaternary) Hadamard matrix. It is shown that the existence of a projective plane of order $n$ is equivalent to the existence of a balancedly multi-splittable (quaternary) Hadamard matrix of order $n^2$.

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

An assosiahedron $\mathcal{K}^n$, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in $\mathbf{R}^{n}$, forming $(n-1)$-dimensional polytope. A…