Related papers: The Pop-stack-sorting Operator on Tamari Lattices
The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere,…
Let $(W,S)$ be a finite Coxeter system. Tits defined an associative product on the set $\Sigma$ of simplices of the associated Coxeter complex. The corresponding semigroup algebra is the Solomon-Tits algebra of $W$. It contains the Solomon…
Let {T_n} be the bipolar filtration of the smooth concordance group of topologically slice knots, which was introduced by Cochran, Harvey, and Horn. It is known that for each n not equal to 1 the quotient group T_n/T_{n+1} has infinite rank…
A new matrix product, called the semi-tensor product (STP), is briefly reviewed. The STP extends the classical matrix product to two arbitrary matrices. Under STP the set of matrices becomes a monoid (semi-group with identity). Some related…
We consider the infinite symmetric group and its infinite index subgroup given as the stabilizer subgroup of one element under the natural action on a countable set. This inclusion of discrete groups induces a hyperfinite subfactor for each…
For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…
Let $S$ be a non-empty, closed subspace of a locally compact group $G$ that is a subsemigroup of $G$. Suppose that $X, Y$, and $Z$ are Banach lattices that are vector sublattices of the order dual $\mathrm{C}_{\mathrm{c}}(S,\mathbb R)^\sim$…
We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…
Transverse-momentum-dependent parton distribution functions and wave functions (TMDPDFs/TMDWFs) can be extracted from lattice calculations of appropriate Euclidean matrix elements of staple-shaped Wilson line operators. We investigate the…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
For every smooth and separated Deligne-Mumford stack $F$, we associate a motive $M(F)$ in Voevodsky's category of mixed motives with rational coefficients $\mathbf{DM}^{\eff}(k,\mathbb{Q})$. When $F$ is proper over a field of characteristic…
The coordination sequence of a lattice $\L$ encodes the word-length function with respect to $M$, a set that generates $\L$ as a monoid. We investigate the coordination sequence of the cyclotomic lattice $\L = \Z[\zeta_m]$, where $\zeta_m$…
We initiate the study of group actions on (possibly infinite) semimatroids and geometric semilattices. To every such action is naturally associated an orbit-counting function, a two-variable "Tutte" polynomial and a poset which, in the…
Consider the following dynamic factor model: $\mathbf{R}_t=\sum_{i=0}^q \mathbf{\Lambda}_i \mathbf{f}_{t-i}+\mathbf{e}_t,t=1,...,T$, where $\mathbf{\Lambda}_i$ is an $n\times k$ loading matrix of full rank, $\{\mathbf{f}_t\}$ are i.i.d.…
Let $d \ge 3$ be an integer. We show that whenever an order-$d$ tensor admits $d+1$ decompositions according to Tao's slice rank, if the linear subspaces spanned by their one-variable functions constitute a sunflower for each choice of…
An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…
Ordering permutations by containment of inversion sets yields a fascinating partial order on the symmetric group: the weak order. This partial order is, among other things, a semidistributive lattice. As a consequence, every permutation has…
The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…
Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…
Given an $m\times n$ binary matrix $M$ with $|M|=p\cdot mn$ (where $|M|$ denotes the number of 1 entries), define the discrepancy of $M$ as $\mbox{disc}(M)=\displaystyle\max_{X\subset [m], Y\subset [n]}\big||M[X\times Y]|-p|X|\cdot…