Related papers: Reductions of Young tableau bijections
In this article, we consider a generalization of Young tableaux in which we allow some consecutive pairs of cells with decreasing labels. We show that this leads to a rich variety of combinatorial formulas, which suggest that these new…
Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
Dyck tilings are certain tilings in the region surrounded by two Dyck paths. We study bijections and combinatorial objects bijective to Dyck tilings, which include Dyck tiling strip (DTS) and Dyck tiling ribbon (DTR) bijections, increasing…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-off between domain and endpoint constraints. We present a family of such bijections for simple walks in Weyl chambers which use arc…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…
We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices…
Attribute and size reductions are key issues in formal concept analysis. In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence. This equivalence relation is based…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
We present a notion of bisimulation that induces a reduced network which is semantically equivalent to the given neural network. We provide a minimization algorithm to construct the smallest bisimulation equivalent network. Reductions that…
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 give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
This paper is about the Mackey analogy between the tempered representation theory of a real reductive group and that of its Cartan motion group. We consider the embedding of reduced C*-algebras constructed recently in connection with the…
A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which reduces the size of the proof. It…
We generalize reduction theorems for classical connections to operators with values in $k$-th order natural bundles. Using the first reduction theorem in order two we classify all (0,2)-tensor fields on the cotangent bundle of a manifold…
Twin reduction defines an equivalence relation on the vertex set of a graph. I give a characterisation of this equivalence relation. A consequence is a structure theorem for the automorphism group of the graph.