Related papers: Ferrers Graphs, D-Permutations, and Surjective Sta…
The aim of this paper is to present a new simple recurrence for Appell and Sheffer sequences in terms of the linear functional that defines them, and to explain how this is equivalent to several well-known characterizations appearing in the…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
We attempt to explain the ubiquity of tableaux and of Pieri and Cauchy formulae for combinatorially defined families of symmetric functions. We show that such formulae are to be expected from symmetric functions arising from representations…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…
There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…
Exceptional orthogonal Hermite and Laguerre polynomials have been linked to the k-step extension of harmonic and singular oscillators. The exceptional polynomials allow the existence of different supercharges from the Darboux-Crum and…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…
Some of the most classically relevant Hyperplane arrangements are the Braid Arrangements $B_n$ and their associated compliment spaces $\mathcal{F}_n$. In their recent work, Tsilevich, Vershik, and Yuzvinsky construct what they refer to as…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given a hypergraph $H$ and a sequence $f=(f_1,f_2, \ldots, f_p)$…