English
Related papers

Related papers: Generalized non-crossing Partitions and Buildings

200 papers

Let $\Gamma$ be a finite simplicial graph with at least two vertices, and let $G(\Gamma)$ be the associated right-angled Artin group. We describe a locally compact group $\mathcal U$ containing $G(\Gamma)$ as a cocompact lattice. If…

Group Theory · Mathematics 2025-06-11 Pierre-Emmanuel Caprace , Tom De Medts

We consider a generalization of the quiver varieties of Lusztig and Nakajima to the case of all symmetrizable Kac-Moody Lie algebras. To deal with the non-simply laced case one considers admissible automorphisms of a quiver and the…

Quantum Algebra · Mathematics 2007-05-23 Alistair Savage

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…

Group Theory · Mathematics 2018-10-08 Valentin Braun

We construct a nonuniform lattice and an infinite family of uniform lattices in the automorphism group of a hyperbolic building with all links a fixed finite building of rank 2 associated to a Chevalley group. We use complexes of groups and…

Group Theory · Mathematics 2007-05-23 Anne Thomas

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

Group Theory · Mathematics 2021-09-13 Marco Linton

We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…

Logic · Mathematics 2014-03-24 Pierre Gillibert

This manuscript studies a special case of the Hurwitz enumeration problem: for branched covers from genus g compact Riemann surface to the Riemann sphere, with three branch points, and require the branching data at one of the branch points…

Combinatorics · Mathematics 2026-05-26 Yi Song

In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…

Combinatorics · Mathematics 2016-12-12 Joel Brewster Lewis , Victor Reiner

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

Group Theory · Mathematics 2014-04-22 Tullia Dymarz

Let H be a k-uniform hypergraph whose vertices are the integers 1,...,N. We say that H contains a monotone path of length n if there are x_1 < x_2 < ... < x_{n+k-1} so that H contains all n edges of the form {x_i,x_{i+1},...,x_{i+k-1}}. Let…

Combinatorics · Mathematics 2012-06-19 Guy Moshkovitz , Asaf Shapira

We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…

Number Theory · Mathematics 2025-11-05 Lenny Fukshansky , Evelyne Knight

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

We prove noncoherence of certain families of lattices in the isometry group of the hyperbolic n-space for n greater than 3. For instance, every nonuniform arithmetic lattice in SO(n,1) is noncoherent, provided that n is at least 6.

Group Theory · Mathematics 2009-04-21 Michael Kapovich , Leonid Potyagailo , Ernest Vinberg

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus…

Combinatorics · Mathematics 2014-04-23 Drew Armstrong , Christopher R. H. Hanusa , Brant C. Jones

We investigate the metric structure of the intersection lattice L(B(n,k)) of the discriminantal arrange ment using circuit supports. We show that the cover graph associated with L(B(n,k)) is isometrically embedded into a hypercube, making…

Combinatorics · Mathematics 2026-03-25 Pragnya Das

We introduce a class of noncommutatative algebras called representation complete intersections (RCI). A graded associative algebra A is said to be RCI provided there exist arbitrarily large positive integers n such that the scheme Rep_n(A),…

Algebraic Geometry · Mathematics 2007-05-23 Pavel Etingof , Victor Ginzburg

Let $\Gamma$ be a graph product of finite groups, with finite underlying graph, and let $\Delta$ be the associated right-angled building. We prove that a uniform lattice $\Lambda$ in the cubical automorphism group Aut$(\Delta)$ is weakly…

Group Theory · Mathematics 2024-02-06 Sam Shepherd

By using results by D. Witte on the superigidity of lattices in solvable Lie groups we get a different proof of a recent remarkable result obtained by D. Guan on the de Rham cohomology of a compact solvmanifold, i.e. of a quotient of a…

Differential Geometry · Mathematics 2009-12-11 Sergio Console , Anna Fino

We show that in a rank supersolvable lattice that is graded by a bounded real interval, any antichain cutset is a level set for some appropriately constructed grading. As a consequence, given an antichain cutset in any of the measurable…

Combinatorics · Mathematics 2026-03-03 Stephan Foldes , Russ Woodroofe

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

Computational Geometry · Computer Science 2025-10-21 Zachary Abel , Erik D. Demaine , Martin L. Demaine , Sarah Eisenstat , Jayson Lynch , Tao B. Schardl
‹ Prev 1 8 9 10 Next ›