相关论文: Pak-Stanley labeling of the $m$-Catalan hyperplane…
We characterise the Pak-Stanley labels of the regions of a family of hyperplane arrangements that interpolate between the Shi arrangement and the Ish arrangement.
It is known that the Pak-Stanley labeling of the Shi hyperplane arrangement provides a bijection between the regions of the arrangement and parking functions. For any graph G, we define the G-semiorder arrangement and show that the…
The Pak-Stanley labeling is a bijection between the regions of the $m$-Shi arrangement and the $m$-parking functions. Mazin generalized this labeling to every deformation of the braid arrangement and proved that this labeling is always…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
The original Pak-Stanley labeling was defined by Pak and Stanley as a bijective map from the set of regions of an extended Shi arrangement to the set of parking functions. This map was later generalized to other arrangements associated with…
Given a simple graph $G$, one can define a hyperplane arrangement called the $G$-Shi arrangement. The Pak-Stanley algorithm labels the regions of this arrangement with $G_\bullet$-parking functions. When $G$ is a complete graph, we recover…
In this paper we study the topology of the strata, indexed by number partitions $\lambda$, in the natural stratification of the space of monic hyperbolic polynomials of degree $n$. We prove stabilization theorems for removing an independent…
Associated with the $r$-Shi arrangement and $r$-Catalan arrangement in $\Bbb{R}^n$, we introduce a cubic matrix for each region to establish two bijections in a uniform way. Firstly, the positions of minimal positive entries in column…
In 1996, Stanley extended the classical Catalan arrangement and semiorder arrangement, which are called the Catalan-type arrangement $\mathcal{C}_{n,A}$ and the semiorder-type arrangement $\mathcal{C}_{n,A}^*$ in this paper. By establishing…
Back in the nineties Pak and Stanley introduced a labeling of the regions of a k-Shi arrangement by k-parking functions and proved its bijectivity. Duval, Klivans, and Martin considered a modification of this construction associated with a…
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson.…
We introduce a new family of hyperplane arrangements in dimension $n\geq3$ that includes both the Shi arrangement and the Ish arrangement. We prove that all the members of a given subfamily have the same number of regions - the connected…
We introduce the relation ${\rho}_{\lambda}$-orthogonality in the setting of normed spaces as an extension of some orthogonality relations based on norm derivatives, and present some of its essential properties. Among other things, we give…
For every irreducible complex representation~$\pi_\lambda$ of the symmetric group~$\S_n$, we construct, in a canonical way, a so-called intrinsic hyperplane arrangement~$\A_{\lambda}$ in the space of~$\pi_\lambda$. This arrangement is a…
Exploiting label correlations is important to multi-label classification. Previous methods capture the high-order label correlations mainly by transforming the label matrix to a latent label space with low-rank matrix factorization.…
We classify proper holomorphic mappings between generalized pseudoellipsoids of different dimensions. Those domains are parametrized by the exponents. The relations among them are also obtained. Main tool is the orthogonal decomposition of…
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
A connected component labeling algorithm is developed for implicitly-defined domains specified by multivariate polynomials. The algorithm operates by recursively subdividing the constraint domain into hyperrectangular subcells until the…