Related papers: The Weak Bruhat Order and Separable Permutations
Gessel's fundamental and Stembridge's peak functions are the generating functions for (enriched) $P$-partitions on labelled chains. They are also the bases of two significant subalgebras of formal power series, respectively the ring of…
For a permutation $\pi$ in the symmetric group $S_n$ let the {\it total degree} be its valency in the Hasse diagram of the strong Bruhat order on $S_n$, and let the {\it down degree} be the number of permutations which are covered by $\pi$…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
Let $G$ be a locally compact abelian group with Pontraygin dual $\widehat{G}$. Suppose $P$ is a closed subsemigroup of $G$ containing the identity element $0$. We assume that $P$ has dense interior and $P$ generates $G$. Let…
For generators of Markov semigroups which lack a spectral gap, it is shown how bounds on the density of states near zero lead to a so-called "weak Poincar\'e inequality" (WPI), originally introduced by Liggett [Ann. Probab., 1991].…
In this article, we present weighted norm inequality for a fractional one-sided minimal function. We prove weighted weak and strong type norm inequalities for the one-sided minimal function on $\mathbb{R}.$ We construct two weight classes…
A permutation \tau contains another permutation \sigma as a pattern if \tau has a subsequence whose elements are in the same order with respect to size as the elements in \sigma. This defines a partial order on the set of all permutations,…
In this paper we study forms of the type $(x_1^2+ \cdots +x_m^2)(y_1^2+ \cdots+y_n^2)$ using projections. For $m=1, m=2$, and for any $n$ we describe: the forbidden locus, the structure and the Hilbert function of all minimal apolar sets.…
An algorithm is presented for unranking permutations in transposition order: Given a seed s\in N, the algorithm produces a permutation P(s) that differs from the permutation P(s+1) by the transposition of two elements.
An occurrence of a consecutive permutation pattern $p$ in a permutation $\pi$ is a segment of consecutive letters of $\pi$ whose values appear in the same order of size as the letters in $p$. The set of all permutations forms a poset with…
Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…
A set $S\subseteq 2^E$ of subsets of a finite set $E$ is \emph{powerful} if, for all $X\subseteq E$, the number of subsets of $X$ in $S$ is a power of 2. Each powerful set is associated with a non-negative integer valued function, which we…
We introduce a two-parameter expectation thinning operator based on a linear fractional probability generating function. The operator is then used to define a first-order integer-valued autoregressive \inar1 process. Distributional…
Let $\Sigma_{g,r}$ denote the $r$-punctured closed Riemann surface of genus $g$. For every $g\geq 0$, we determine the four-variable generating function for the mixed Hodge numbers of the unordered configuration spaces of $\Sigma_{g,1}$.…
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…
For a residually finite group $G$, its normal subgroups $G\supset G_1\supset G_2\cdots$ with $\cap_{n\in\mathbb N}G_n=\{e\}$ and for a growth function $\gamma$ we construct a unitary representation $\pi_\gamma$ of $G$. For the minimal…
The Bruhat order on permutations arises out of the study of Schubert varieties in Grassmannians and flag varieties, which have been important for over 100 years. The purpose of this paper is to study variations on this theme related to…
A weakly consecutive sequence (WCS) is a permutation $\sigma$ of $\{1, \ldots, k\}$ such that if an integer $d$ divides $\sigma(i)$, then $d$ also divides $\sigma(i \pm d)$ insofar as these are defined. The structure of weakly consecutive…
We show that if a permutation $\pi$ contains two intervals of length 2, where one interval is an ascent and the other a descent, then the M\"{o}bius function $\mu[\pi]$ of the interval $[1,\pi]$ is zero. As a consequence, we show that the…
We derive a uniform bound for the difference of two contractive semigroups, if the difference of their generators is form-bounded by the Hermitian parts of the generators themselves. We construct a semigroup dynamics for second order…