Related papers: Tower Tableaux
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
In the last decades, several objects such as grammars, economical agents, laws of physics... have been defined as algorithms. In particular, after Brouwer, Heyting, and Kolomogorov, mathematical proofs have been defined as algorithms. In…
Many algorithms have been developed for enumerating various combinatorial objects in time exponentially less than the number of objects. Two common classes of algorithms are dynamic programming and the transfer matrix method. This paper…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We define a tower of injections of $\tilde{B}$-type (resp. $\tilde{D}$-type) Coxeter groups $W(\tilde B_{n})$ (resp. $W(\tilde D_{n})$) for $n\geq 3$. Let $W^c(\tilde B_{n})$ (resp. $W^c(\tilde D_{n})$) be the set of fully commutative…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…
The community structure of a complex network can be determined by finding the partitioning of its nodes that maximizes modularity. Many of the proposed algorithms for doing this work by recursively bisecting the network. We show that this…
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to…
Previous work combines word-level and character-level representations using concatenation or scalar weighting, which is suboptimal for high-level tasks like reading comprehension. We present a fine-grained gating mechanism to dynamically…
Complex prediction models such as deep learning are the output from fitting machine learning, neural networks, or AI models to a set of training data. These are now standard tools in science. A key challenge with the current generation of…
A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…
We define a birational map between labelings of a rectangular poset and its associated trapezoidal poset. This map tropicalizes to a bijection between the plane partitions of these posets of fixed height, giving a new bijective proof of a…
This paper is devoted to the presentation of a combinatorial approach for analyzing the performance of an important modulation protocol used in mobile telecommunications. We show in particular that a fundamental formula, in this context, is…
Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification.…
Most of the time, the first step to learn word embeddings is to build a word co-occurrence matrix. As such matrices are equivalent to graphs, complex networks theory can naturally be used to deal with such data. In this paper, we consider…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…