Related papers: On reduced expressions for core double cosets
We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We use symplectic reduction to give a new construction of the core $C$ of a symplectic double groupoid $D$ as the common leaf space of characteristic foliations associated to various coisotropic submanifolds of $D$. In the case of the…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.
Skew lattices are non-commutative generalizations of lattices, and the cosets represent the building blocks that skew lattices are built of. As by Leech's Second Decomposition Theorem any skew lattice embeds into a direct product of a…
The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…
Double Boolean algebras (dBas), introduced by Wille, are based on twenty-three identities. We present a simplified axiom system, the D-core algebra, and prove it is equivalent to Wille's original definition. This reduction allows improved…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
In an atomic Bose-Einstein condensate quenched to the unitary regime, we predict the sequential formation of a significant fraction of condensed pairs and triples. At short-distances, we demonstrate the two-body and Efimovian character of…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
Trapped bosonic atoms can be cooled down to temperatures where the atomic cloud experiences Bose-Einstein condensation. Almost all atoms in a dilute gaseous system can be Bose-condensed, which implies that this system is in a coherent…
We construct several quantum coset W-algebras, e.g. sl(2,R)/U(1) and sl(2,R)+sl(2,R) / sl(2,R), and argue that they are finitely nonfreely generated. Furthermore, we discuss in detail their role as unifying W-algebras of Casimir W-algebras.…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…