中文
相关论文

相关论文: On permutation polytopes

200 篇论文

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

度量几何 · 数学 2009-06-08 Daniel Pellicer , Egon Schulte

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

组合数学 · 数学 2009-08-13 Sandeep Koranne , Anand Kulkarni

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

高能物理 - 理论 · 物理学 2009-10-28 S. Boukraa , J-M. Maillard , G. Rollet

Let $q=2^m.$ In a recent paper \cite{Zhang3}, Zhang and Zheng investigated several classes of permutation pentanomials of the form $\epsilon_0x^{d_0}+L(\epsilon_{1}x^{d_1}+\epsilon_{2}x^{d_2})$ over ${\mathbb F}_{q^3}~(d_0=1,2,4)$ from some…

数论 · 数学 2025-01-28 Tongliang Zhang , Lijing Zheng , Hengtai Wang , Jie Peng , Yanjun Li

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…

组合数学 · 数学 2024-02-05 Andrei Asinowski , Jean Cardinal , Stefan Felsner , Éric Fusy

Let n >= 2 be an integer and consider the set T_n of n by n permutation matrices pi for which pi_{ij}=0 for j>=i+2. In this paper we study the convex hull of T_n, which we denote by P_n. P_n is a polytope of dimension binom{n}{2}. Our main…

组合数学 · 数学 2007-05-23 Clara S. Chan , David P. Robbins , David S. Yuen

The beta polytope $P_{n,d}^\beta$ is the convex hull of $n$ i.i.d. random points distributed in the unit ball of $\mathbb{R}^d$ according to a density proportional to $(1-\lVert{x}\rVert^2)^{\beta}$ if $\beta>-1$ (in particular, $\beta=0$…

概率论 · 数学 2021-02-03 Gilles Bonnet , Zakhar Kabluchko , Nicola Turchi

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

组合数学 · 数学 2017-12-05 Xin Fang , Ghislain Fourier , Jan-Philipp Litza , Christoph Pegel

If a convex body C has modular and irreducible face lattice (and is not strictly convex), there is a face-preserving homeomorphism from C to a section of a cone of hermitian matrices or C has dimension 8, 14 or 26.

几何拓扑 · 数学 2009-03-05 D. Labardini-Fragoso , M. Neumann-Coto , M. Takane

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…

组合数学 · 数学 2011-03-31 Kira Adaricheva

We clarify the notion of effective equivalence and characterize geometrically the effectively equivalent permutation groups. In particular, we present examples showing that the latter do not correspond to affinely equivalent polytopes…

组合数学 · 数学 2014-04-04 Barbara Baumeister , Matthias Grueninger

Mixture models on order relations play a central role in recent investigations of transitivity in binary choice data. In such a model, the vectors of choice probabilities are the convex combinations of the characteristic vectors of all…

组合数学 · 数学 2015-11-03 Jean-Paul Doignon , Selim Rexhep

We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…

综合数学 · 数学 2007-05-23 Rakotonirina Christian

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

度量几何 · 数学 2015-06-23 Michael Gene Dobbins , Andreas Holmsen , Alfredo Hubard

The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…

组合数学 · 数学 2025-10-16 Abdulrahman Alajmi , Sayok Chakravarty , Zachary Kaplan , Jenya Soprunova

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

概率论 · 数学 2012-06-22 Pierre Calka , J. E. Yukich

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

组合数学 · 数学 2007-05-23 Fu Liu

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

组合数学 · 数学 2018-04-05 Daniele Bartoli

We develop formulas that define permutahedral commutation coherence relations of all orders. To illustrate the result geometrically, we begin by defining a rigid transformation of the $(n+1)$-permutahedron into a $n$-cube of dimensions $1…

范畴论 · 数学 2024-08-02 Astra Kolomatskaia

The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…

表示论 · 数学 2026-02-04 Jiawei He , Xiaogang Li