Related papers: Orientations, semiorders, arrangements, and parkin…
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…
We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…
In this paper we briefly review the main idea of the localization technique and its extension suitable in supersymmetric gauge field theory. We analyze the partition function of the vector multiplets with supercharges and its blocks on the…
We classify isoparametric functions on Damek-Ricci spaces which can be written in terms of the standard coordinates $(v,z,t)$ on the half-space model as a polynomial function divided by $t$. Regular level sets of the functions in our…
This paper establishes connections between the structure of a semigroup and the minimum spans of distance labellings of its Cayley graphs. We show that certain general restrictions on the minimum spans are equivalent to the semigroup being…
The goal of this note two-fold. First, I draw attention to the way that semistability (in the sense of King) gives us a geometrical picture of (some of) the extension-closed abelian subcategories of a finite-dimensional algebra. Second, I…
We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…
We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…
Warning. The reading of this paper will send you down many winding roads toward new and exciting research topics enumerating generalized parking functions. Buckle up!
In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…
We classify complex hyperplane arrangements $\mathcal A$ whose intersection posets $L(\mathcal A)$ satisfy $L(\mathcal A)=\pi_i^{-1}\circ\pi_i\bigl(L(\mathcal A)\bigr)$ for $i=1,\dots,n$. Here $\pi_i$ denotes the projection from $\mathbb…
Let $ G $ be a simple graph of $ \ell $ vertices $ \{1, \dots, \ell \} $ with edge set $ E_{G} $. The graphical arrangement $ \mathcal{A}_{G} $ consists of hyperplanes $ \{x_{i}-x_{j}=0\} $, where $ \{i, j \} \in E_{G} $. It is well known…
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open…
We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…
This work investigates the duality between two discrete dynamical processes: parking functions, and the Abelian sandpile model (ASM). Specifically, we are interested in the extension of classical parking functions, called $G$-parking…
Let ${\mathcal A}$ be a nonempty real central arrangement of hyperplanes and ${\rm \bf Ch}$ be the set of chambers of ${\mathcal A}$. Each hyperplane $H$ defines a half-space $H^{+} $ and the other half-space $H^{-}$. Let $B = \{+, -\}$.…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
In this paper, we infer the statuses of a taxi, consisting of occupied, non-occupied and parked, in terms of its GPS trajectory. The status information can enable urban computing for improving a city's transportation systems and land use…