Related papers: Extended Abstract: Canonical join complex and cubi…
We initiate a new approach to the study of the combinatorics of several parametrizations of canonical bases. In this work we deal with Lie algebras of type $A$. Using geometric objects called Rhombic tilings we derive a "crossing formula"…
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
We investigate the extensions of the Hecke algebras of finite (complex) reflection groups by lattices of reflection subgroups that we introduced, for some of them, in our previous work on the Yokonuma-Hecke algebras and their connections…
This paper studies expansions of bounded distributive lattices equipped with a Galois connection. We introduce GC-frames and canonical frames for these algebras. The complex algebras of GC-frames are defined in terms of rough set…
We study definite fillings of lens spaces. We classify the lens spaces $L(p,q)$ for which every smooth negative-definite filling $X$ satisfies \[ b_2(X)\ge b_2(X(p,q))-1, \] where $X(p,q)$ denotes the canonical negative-definite plumbing.…
Canonical forms for congruence and *congruence of square complex matrices were given by Horn and Sergeichuk in [Linear Algebra Appl. 389 (2004) 347-353], based on Sergeichuk's paper [Math. USSR, Izvestiya 31 (3) (1988) 481-501], which…
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
The $\gamma$-Cambrian semilattices $\mathcal{C}_{\gamma}$ defined by Reading and Speyer are a family of meet-semilattices associated with a Coxeter group $W$ and a Coxeter element $\gamma\in W$, and they are lattices if and only if $W$ is…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
This thesis proposes a framework based on a notion of combinatorial cell complex (cc) whose cells are defined simply as finite sets of vertices. The cells of a cc are subject to four axioms involving a rank function that assigns a rank (or…
For classical discrete systems under constant composition, we re-examine how linear-nonlinear boundary in canonical ensemble, connecting a set of potential energy surface and that of microscopic configuration in thermodynamic equilibrium,…
The cornerstone of statistical mechanics of complex networks is the idea that the links, and not the nodes, are the effective particles of the system. Here we formulate a mapping between weighted networks and lattice gasses, making the…
We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…