Related papers: Combinatorial characterzations of $T$-designs in t…

In this article we give a classification of the sub-groups in PSL(2,Z) and of the conjugacy classes of these sub-groups by the mean of an combinatorial invariant: some trivalent diagrams (dotted or not). We give explicit formulae enabling…

We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…

This paper develops an econometric framework and tools for the identification and inference of a structural parameter in general bunching designs. We present point and partial identification results, which generalize previous approaches in…

This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…

We construct a complex of toric varieties we call the quasisymmetric Grassmannian inside the Grassmannian of $r$-planes in $\mathbb{C}^n$. Each irreducible component is a positroid variety and an $S_n$ translate of a toric Richardson…

This paper delves into the Terwilliger algebra associated with the ordered Hamming scheme, which extends from the wreath product of one-class association schemes and was initially introduced by Delsarte as a natural expansion of the Hamming…

In 1985, Janko and Tran Van Trung published an algorithm for constructing symmetric designs with prescribed automorphisms. This algorithm is based on the equations by Dembowski (1958) for tactical decompositions of point-block incidence…

In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into description logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular,…

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…

We denote by A the ring of Laurent polynomials in the indeterminate v and by K its field of fractions. In this paper, we are interested in representation theory of the "generic" q-Schur algebra S_q(n,r) over A. We will associate to every…

Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…

Let $R$ be an arbitrary subset of a commutative ring. We introduce a combinatorial model for the set of tame frieze patterns with entries in $R$ based on a notion of irreducibility of frieze patterns. When $R$ is a ring, then a frieze…

Nonregular fractional factorial designs such as Plackett-Burman designs and other orthogonal arrays are widely used in various screening experiments for their run size economy and flexibility. The traditional analysis focuses on main…

In this paper, we continue the development of a new combinatorial model for the irreducible characters of a complex semisimple Lie group. This model, which will be referred to as the alcove path model, can be viewed as a discrete…

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use deterministic and probabilistic methods to analyse the…

We introduce a class of paired binary matrices called admixed arrays, which arise in analyses of large-scale genetic data and can be viewed as weighted edge colorings of complete bipartite graphs. This combinatorial structure gives rise to…

In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…