Related papers: Hook-lengths and Pairs of Compositions
We generalize the notion of linear chord diagrams to the case of matched sets of size $k$, which we call $k$-chord diagrams. We provide formal generating functions and recurrence relations enumerating these $k$-chord diagrams by the number…
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…
The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Specializing to the product of a cyclic code and a skew-cyclic…
In compositional data, detecting which part of the whole delineates heterogeneity is important. The aim is to propose a procedure to quantify this term in the multivariate regression context without abandoning the data's natural…
A polynomial P in n complex variables is said to have the "half-plane property" (or Hurwitz property) if it is nonvanishing whenever all the variables lie in the open right half-plane. Such polynomials arise in combinatorics, reliability…
We study the sequence of monic polynomials $\{S_n\}_{n\geqslant 0}$, orthogonal with respect to the Jacobi-Sobolev inner {product} \;$$ \langle f,g\rangle_{\mathsf{s}}= \int_{-1}^{1} f(x) g(x)\,…
We investigate some properties of non-symmetric Jack, Hermite and Laguerre polynomials which occur as the polynomial part of the eigenfunctions for certain Calogero-Sutherland models with exchange terms. For the non-symmetric Jack…
Harmonic centrality calculates the importance of a node in a network by adding the inverse of the geodesic distances of this node to all the other nodes. Harmonic centralization, on the other hand, is the graph-level centrality score based…
We construct a generalization of the theory of symmetric functions involving functions of commuting and anticommuting (Grassmannian) variables. These new functions, called symmetric functions in superspace, are invariant under the diagonal…
The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…
We examine three methods for ranking by pairwise comparison: Principal Eigenvector, HodgeRank and Tropical Eigenvector. It is shown that the choice of method can produce arbitrarily different rank order.To be precise, for any two of the…
In this paper, we take interest in finding applications for a hook-length formula recently proved in (Morales Pak Panova 2016). This formula can be applied to give a non trivial relation between alternating permutations and weighted Dyck…
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…
We study Jack polynomials in $N$ variables, with parameter $\alpha$, and having a prescribed symmetry with respect to two disjoint subsets of variables. For instance, these polynomials can exhibit a symmetry of type AS, which means that…
We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
This paper introduces a novel recurrent model for music composition that is tailored to the structure of polyphonic music. We propose an efficient new conditional probabilistic factorization of musical scores, viewing a score as a…