相关论文: $k$-Ribbon Fibonacci Tableaux

Here we completely determine the spin parity of $k$-differentials with prescribed zero and pole orders on Riemann surfaces of genus zero and one. This result was previously obtained conditionally by the first author and Quentin Gendron…

Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…

We study algorithmic matroid intersection coloring. Given $k$ matroids on a common ground set $U$ of $n$ elements, the goal is to partition $U$ into the fewest number of color classes, where each color class is independent in all matroids.…

The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

We give a sufficient geometric condition for a subshift to be measurably isomorphic to a domain exchange and to a translation on a torus. And for an irreducible unit Pisot substitution, we introduce a new topology on the discrete line and…

The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…

We include the relativistic lattice KP hierarchy, introduced by Gibbons and Kupershmidt, into the $r$-matrix framework. An $r$-matrix account of the nonrelativistic lattice KP hierarchy is also provided for the reader's convenience. All…

A Redheffer--type matrix with Fibonacci entries is defined, and the determinant and spectral properties of this matrix are studied. Also, more general Redheffer--type matrices are considered and intriguing number-theoretic examples are…

One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Constraint Satisfaction Problem CSP(G) is either NP--complete or…

We introduce affine Stanley symmetric functions for the special orthogonal groups, a class of symmetric functions that model the cohomology of the affine Grassmannian, continuing the work of Lam and Lam, Schilling, and Shimozono on the…

Fermion-to-qubit mappings are used to represent fermionic modes on quantum computers, an essential first step in many quantum algorithms for electronic structure calculations. In this work, we present a formalism to design flexible…

Based on the matrix ansatz of Derrida, Evans, Hakim and Pasquier, we prensent a new way of computing the stationary probability of a state of the asym- metric simple exclusion process (ASEP). Through an insertion algorithm over staircase…

In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the…

We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is…

We introduce an algorithm to determine when a sorting operation, such as stack-sort or bubble-sort, outputs a given pattern. The algorithm provides a new proof of the description of West-2-stack-sortable permutations, that is permutations…

We give enumerations of various families of restricted permutations involving the Fibonacci numbers or k-generalized Fibonacci numbers.

We introduce a new model of interacting spin 1/2. It describes interaction of three nearest neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate (also known as the CSWAP gate) is a computational circuit…

We propose a generalization of the supersymmetric representation of spins with symplectic symmetry, generalizing the rotation group of the spin from SU(2) to SP(N). As a test application of this new representation, we consider two toy…

A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…