Related papers: Constructing Extended Formulations from Reflection…

McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…

Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation formulas by using contiguous relations have been obtained. On the one hand, these recursive equations are quite suitable for symbolic and numerical evaluation by…

We obtain a reflection formula for the Gaussian hypergeometric function of real symmetric matrix argument. We also show that this result extends to the Gaussian hypergeometric function defined over the symmetric cones, and even to…

Let W be an Iwahori-Weyl group of a connected reductive group G over a non-archimedean local field. I prove that if w is an element of W that does not act on the corresponding apartment of G by a translation then one can apply to w a…

We continue the study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we show the following results: Theorem A: The multiple…

In this paper we report on results of our investigation into the algebraic structure supported by the combinatorial geometry of the cyclohedron. Our new graded algebra structures lie between two well known Hopf algebras: the…

We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…

In this paper we propose a generalization of the extension complexity of a polyhedron $Q$. On the one hand it is general enough so that all problems in $P$ can be formulated as linear programs with polynomial size extension complexity. On…

Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…

We present a class of Poisson structures on trivial extension algebras which generalize some known structures induced by Poisson modules. We show that there exists a one-to-one correspondence between such a class of Poisson structures and…

A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…

This is an English translation of the author's Ph.D. thesis, accumulating his results on a construction of Cohen-Macaulay modules over a polynomial ring that appeared in the study of Cauchy-Fueter equations. This construction is generalized…

Let $\mathfrak g$ be a simple Lie algebra with Cartan subalgebra $\mathfrak h$ and Weyl group $W$. We build up a graded map $(\mathcal H\otimes \bigwedge\mathfrak h\otimes \mathfrak h)^W\to (\bigwedge \mathfrak g\otimes \mathfrak…

This is a chapter in an upcoming Tamari Festscrift. Permutahedra are a class of convex polytopes arising naturally from the study of finite reflection groups, while generalized associahedra are a class of polytopes indexed by finite…

Circuits and extended formulations are classical concepts in linear programming theory. The circuits of a polyhedron are the elementary difference vectors between feasible points and include all edge directions. We study the connection…

We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

This paper develops a correspondence relating convex hulls of fractional functions with those of polynomial functions over the same domain. Using this result, we develop a number of new reformulations and relaxations for fractional…

Let $P$ be a polytope. The hitting number of $P$ is the smallest size of a hitting set of the facets of $P$, i.e., a subset of vertices of $P$ such that every facet of $P$ has a vertex in the subset. An extended formulation of $P$ is the…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…