English
Related papers

Related papers: Orientations, semiorders, arrangements, and parkin…

200 papers

The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…

Exactly Solvable and Integrable Systems · Physics 2018-06-26 M. Bertola , B. Eynard , J. Harnad

Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…

Combinatorics · Mathematics 2021-08-27 Anton Dochtermann , Westin King

A unified construction of high order shape functions is given for all four classical energy spaces ($H^1$, $H(\mathrm{curl})$, $H(\mathrm{div})$ and $L^2$) and for elements of "all" shapes (segment, quadrilateral, triangle, hexahedron,…

Numerical Analysis · Mathematics 2016-05-31 Federico Fuentes , Brendan Keith , Leszek Demkowicz , Sriram Nagaraj

This paper is devoted to the study of semigroups of composition operators and semigroups of holomorphic mappings. We establish conditions under which these semigroups can be extended in their parameter to sector given a priori. We show that…

Complex Variables · Mathematics 2015-11-17 Mark Elin , Fiana Jacobzon

Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…

Geometric Topology · Mathematics 2016-06-13 Nir Gadish

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…

Combinatorics · Mathematics 2014-08-26 Sylvie Corteel , David Forge , Véronique Ventos

We study the sets of semistar and star operation on a semilocal Pr\"ufer domain, with an emphasis on which properties of the domain are enough to determine them. In particular, we show that these sets depend chiefly on the properties of the…

Commutative Algebra · Mathematics 2017-07-25 Dario Spirito

In 1983, Lusztig defined a map $\sigma$ from affine permutations of $n$ to partitions of $n$. He conjectured that for any partition $\lambda$ of $n$, $\sigma^{-1}(\lambda)$ is a two-sided cell. Shi, in 1986, proved part of this conjecture.…

Combinatorics · Mathematics 2021-01-01 Susanna Fishel

We define a "shifted analogue" $\mathrm{SH}_n$ of the parking function symmetric function $\mathrm{PF}_n$. The expansion of $\mathrm{SH}_n$ in terms of three bases for shifted symmetric functions is explicitly described. We don't know a…

Combinatorics · Mathematics 2024-05-06 Richard P. Stanley

An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas,…

Combinatorics · Mathematics 2025-03-04 Garrett Nelson

A matching $M$ in a multigraph $G=(V,E)$ is said to be uniquely restricted if $M$ is the only perfect matching in the subgraph of $G$ induced by $V(M)$ (i.e., the set of vertices saturated by $M$). For any fixed vertex $x_0$ in $G$, there…

Combinatorics · Mathematics 2018-08-03 Fengming Dong

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

Label spreading is a general technique for semi-supervised learning with point cloud or network data, which can be interpreted as a diffusion of labels on a graph. While there are many variants of label spreading, nearly all of them are…

Machine Learning · Computer Science 2020-06-09 Francesco Tudisco , Austin R. Benson , Konstantin Prokopchik

We give a necessary and sufficient condition in order for a hyperplane arrangement to be of Torelli type, namely that it is recovered as the set of unstable hyperplanes of its Dolgachev sheaf of logarithmic differentials. Decompositions and…

Algebraic Geometry · Mathematics 2019-02-20 Daniele Faenzi , Daniel Matei , Jean Vallès

We study the Z/2-equivariant K-theory of the complement of the complexification of a real hyperplane arrangement. We compute the rational K and KO rings, and give two different combinatorial descriptions of the subring of the integral KO…

Combinatorics · Mathematics 2007-05-23 Nicholas J. Proudfoot

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

Combinatorics · Mathematics 2023-06-16 Richard P. Stanley , Mei Yin

The braid arrangement is the Coxeter arrangement of the type $A_\ell$. The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the braid arrangement and their parallel translations. In this paper, we…

Combinatorics · Mathematics 2015-07-21 Daisuke Suyama , Hiroaki Terao

Characteristic quasi-polynomials are the enumerative functions counting the number of elements in the complement of hyperplane arrangements modulo positive integers. A notable phenomenon in this context is period collapse, where the…

Combinatorics · Mathematics 2026-02-09 Akihiro Higashitani , Norihiro Nakashima

Hyperplanes of the form x_j = x_i + c are called affinographic. For an affinographic hyperplane arrangement in R^n, such as the Shi arrangement, we study the function f(M) that counts integral points in [1,M]^n that do not lie in any…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky