English
Related papers

Related papers: Partial permutation and alternating sign matrix po…

200 papers

We provide two new characterizations of bounded orthogonally additive polynomials from a uniformly complete vector lattice into a convex bornological space using harmonic means and completely partitioned weighted geometric means. Our result…

Functional Analysis · Mathematics 2021-09-23 Christopher Schwanke

We study random polytopes of the form $[X_1,\ldots,X_n]$ defined as convex hulls of independent and identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^d$ with one of the following densities: $$ f_{d,\beta} (x) =…

Probability · Mathematics 2020-02-04 Zakhar Kabluchko , Christoph Thaele , Dmitry Zaporozhets

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

K-Theory and Homology · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

Half turn symmetric alternating sign matrices (HTSASMs) are special variations of the well-known alternating sign matrices which have a long and fascinating history. HTSASMs are interesting combinatorial objects in their own right and have…

Combinatorics · Mathematics 2014-04-01 Angèle M. Hamel , Ronald C. King

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

Combinatorics · Mathematics 2026-05-05 Tristram Bogart , Federico Castillo , Damián de la Fuente , David Plaza

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…

Geometric Topology · Mathematics 2020-11-03 Nikolay Bogachev , Alexander Kolpakov

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

Computational Complexity · Computer Science 2022-05-04 Heng Guo , Mark Jerrum

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

Combinatorics · Mathematics 2014-09-18 Sergi Elizalde , Yuval Roichman

Regular semisimple Hessenberg varieties are subvarieties of the flag variety $\mathrm{Flag}(\mathbb{C}^n)$ arising naturally in the intersection of geometry, representation theory, and combinatorics. Recent results of…

Algebraic Geometry · Mathematics 2019-10-08 Megumi Harada , Tatsuya Horiguchi , Mikiya Masuda , Seonjeong Park

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…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…

Combinatorics · Mathematics 2026-05-27 Frédéric Chapoton , Christos A. Athanasiadis

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

Classical Analysis and ODEs · Mathematics 2026-05-28 K. Castillo

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Combinatorics · Mathematics 2017-01-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data arising from the representation of an ASM as a collection of…

Combinatorics · Mathematics 2007-05-23 Benjamin Wieland

In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…

Representation Theory · Mathematics 2022-10-17 Friedrich Knop

We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…

Combinatorics · Mathematics 2017-06-30 Yury Kochetkov

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…

Optimization and Control · Mathematics 2019-03-05 Hamidur Rahman , Ashutosh Mahajan

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…

Combinatorics · Mathematics 2009-06-19 Jean-Christophe Aval , Philippe Duchon