Related papers: The Littlewood-Richardson rule, and related combin…
We present a purely diagrammatic derivation of the dual fermion scheme [Phys. Rev. B 77 (2008) 033101]. The derivation makes particularly clear that a similar scheme can be developed for an arbitrary reference system provided it has the…
In this work, we have proved a version of the Hardy-Littlewood-Sobolev inequality for variable exponents. After we use the variational method to establish the existence of solution for a class of Choquard equations involving the…
We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The…
By inventing the notion of honeycombs, A. Knutson and T. Tao proved the saturation conjecture for Littlewood-Richardson coefficients. The Newell-Littlewood numbers are a generalization of the Littlewood-Richardson coefficients. By…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
In the paper we obtain some new applications of well--known W. Rudin's theorem concerning lacunary series to problems of combinatorial number theory. We generalize a result of M.-C. Chang on L_2 (L)-norm of Fourier coefficients of a set…
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…
We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…
The Littlewood-Richardson coefficients describe the decomposition of tensor products of irreducible representations of a simple Lie algebra into irreducibles. Assuming the number of factors is large, one gets a measure on the space of…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
Stretching the parameters of a Littlewood-Richardson coefficient of value 2 by a factor of n results in a coefficient of value n+1. We give a geometric proof of a generalization for representations of quivers.
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
I briefly introduce the methods by which lattice QCD predictions for RHIC are obtained. Next I deal with lattice determinations of strangeness production and event-to-event fluctuations of conserved quantities. I also present a new…
We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…
The aim of this paper is twofold. First, we demonstrate how Riordan matrices can be employed to connect well-known concepts in geometric combinatorics, such as $f$-vectors, $h$-vectors $\gamma$-vectors, in a similar fashion to the McMullen…