Related papers: Pinnacle sets revisited
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…
We present a simple randomized scheme for triangulating a set $P$ of $n$ points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of $P$ move continuously along piecewise algebraic…
We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…
Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…
We study the classical dynamics of spinning particles using scattering amplitudes and eikonal exponentiation. We show that observables are determined by a simple algorithm. A wealth of complexity arises in perturbation theory as positions,…
The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements where the discrete stress…
In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…
Given a Stirling permutation w, we introduce the mesa set of w as the natural generalization of the pinnacle set of a permutation. Our main results characterize admissible mesa sets and give closed enumerative formulas in terms of rational…
For a finite Coxeter system and a subset of its diagram nodes, we define spherical elements (a generalization of Coxeter elements). Conjecturally, for Weyl groups, spherical elements index Schubert varieties in a flag manifold G/B that are…
In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
The *somewhere-to-below shuffles* are the elements \[ t_{\ell} := \operatorname{cyc}_{\ell}+\operatorname{cyc}_{\ell,\ell+1}+\operatorname{cyc}_{\ell,\ell+1,\ell+2}+\cdots+\operatorname{cyc}_{\ell,\ell+1,\ldots,n} \] (for $\ell \in…
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…
We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
New low-order $H(\textrm{div})$-conforming finite elements for symmetric tensors are constructed in arbitrary dimension. The space of shape functions is defined by enriching the symmetric quadratic polynomial space with the $(d+1)$-order…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
We construct a simple combinatorially-defined representation of $\mathfrak{sl}_2$ which respects the order structure of the weak order on the symmetric group. This is used to resolve a conjecture of Stanley that the weak order has the…
The 2(2s+1)-component relativistic basis spinors for the arbitrary spin particles are established in position, momentum and four-dimensional spaces, where s=0,1 / 2,1, 3 / 2, 2, ... . These spinors for integral- and half-integral spins are…