Related papers: Combinatorial characterzations of $T$-designs in t…
Let (G, \mu) be a pair of a reductive group G over the p-adic integers and a minuscule cocharacter {\mu} of G defined over an unramified extension. We introduce and study "(G, \mu)-displays" which generalize Zink's Witt vector displays. We…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
We prove that a commutative association scheme is imprimitive if and only if it admits a multivariate $P$- or $Q$-polynomial structure with respect to an elimination-type monomial order. This provides a direct bridge between the classical…
We study some aspects of divisionally free arrangements which were recently introduced by Abe. Crucially, Terao's conjecture on the combinatorial nature of freeness holds within this class. We show that while it is compatible with products,…
The nonholonomic constrained system with second-class constraints is investigated using the Hamilton-Jacobi (HJ) quantization scheme to yield the complete equations of motion of the system. Although the integrability conditions in the HJ…
This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…
We give a combinatorial formula for the non-symmetric Macdonald polynomials E_{\mu}(x;q,t). The formula generalizes our previous combinatorial interpretation of the integral form symmetric Macdonald polynomials J_{\mu}(x;q,t). We prove the…
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…
Goulden and Jackson introduced a very powerful method to study the distributions of certain consecutive patterns in permutations, words, and other combinatorial objects which is now called the cluster method. There are a number of natural…
This article studies the scheme structure of the jet schemes of determinantal varieties. We show that in general, these jet schemes are not irreducible. In the case of the determinantal variety $X$ of $r \times s$ matrices of rank at most…
In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…
D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic…
We survey the matrix product solutions of the Yang-Baxter equation obtained recently from the tetrahedron equation. They form a family of quantum $R$ matrices of generalized quantum groups interpolating the symmetric tensor representations…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
The Tautological Lamination arises in holomorphic dynamics as a combinatorial model for the geometry of 1-dimensional slices of the Shift Locus. In each degree $q$ the tautological lamination defines an iterated sequence of partitions of…
The unrestricted T-system is a family of relations in the Grothendieck ring of the category of the finite-dimensional modules of the Yangian or the quantum affine algebra associated with a complex simple Lie algebra. The unrestricted…
We present novel Hamiltonian descriptions of some three-dimensional systems including two well-known systems describing the three-wave-interaction problem and some well-known chaotic systems, namely, the Chen, L\"u, and Qi systems. We show…
The modeling framework of port-Hamiltonian systems is systematically extended to constrained dynamical systems (descriptor systems, differential-algebraic equations). A new algebraically and geometrically defined system structure is…