English
Related papers

Related papers: Braid graphs in simply-laced triangle-free Coxeter…

200 papers

We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…

Representation Theory · Mathematics 2022-07-05 Hongsheng Hu

There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…

Combinatorics · Mathematics 2019-08-29 Rishi Advani

We give criteria for deciding whether or not a triangle-free simple graph is the presentation graph of a right-angled Coxeter group that is quasiisometric to some right-angled Artin group, and, if so, producing a presentation graph for such…

Group Theory · Mathematics 2025-06-23 Christopher H. Cashen , Pallavi Dani , Alexandra Edletzberger , Annette Karrer

We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…

Combinatorics · Mathematics 2007-05-23 R. M. Green , J. Losonczy

We introduce a systematic method for constructing a class of lattice structures that we call ``partial line graphs''.In tight-binding models on partial line graphs, energy bands with flat energy dispersions emerge.This method can be applied…

Strongly Correlated Electrons · Physics 2009-11-11 Shin Miyahara , Kenn Kubo , Hiroshi Ono , Yoshihiro Shimomura , Nobuo Furukawa

This is an expository article on diagrammatic representations of knots and links in various settings via braids.

Geometric Topology · Mathematics 2018-11-29 Sofia Lambropoulou

To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…

Geometric Topology · Mathematics 2008-10-23 T. Fiedler , V. Kurlin

We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…

Algebraic Geometry · Mathematics 2016-03-28 Shunsuke Nakamura , Yuuki Shiraishi , Atsushi Takahashi

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…

Geometric Topology · Mathematics 2007-05-23 Thomas Fleming

Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…

Geometric Topology · Mathematics 2008-05-14 Joan S. Birman , William W. Menasco

The spectrum of integrable models is often encoded in terms of commuting functions of a spectral parameter that satisfy functional relations. We propose to describe this commutative algebra in a covariant way by means of the extended…

Mathematical Physics · Physics 2021-01-11 Simon Ekhammar , Hongfei Shu , Dmytro Volin

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

Geometric Topology · Mathematics 2007-05-23 Thomas W. Mattman , Ryan Ottman , Matt Rodrigues

If G is a finite connected graph, then an arithmetical structure on $G$ is a pair of vectors $(\mathbf{d}, \mathbf{r})$ with positive integer entries such that $(\diag(\mathbf{d}) - A)\cdot \mathbf{r} = \mathbf{0}$, where $A$ is the…

Combinatorics · Mathematics 2024-06-18 Alexander Diaz-Lopez , Brian Ha , Pamela E. Harris , Jonathan Rogers , Theo Koss , Dorian Smith

One version of Whitehead's famous cut vertex lemma says that if an element of a free group is part of a free basis, then a certain graph associated to its conjugacy class that we call the star graph is either disconnected or has a cut…

Group Theory · Mathematics 2025-01-09 Rylee Alanza Lyman

We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…

Logic in Computer Science · Computer Science 2024-07-02 Aliaume Lopez

We define new deformations of group algebras of Coxeter groups W and of subgroups of even elements in them, by deforming the braid relations. We show that these deformations are algebraically flat iff they are formally flat, and that this…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Eric Rains

The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.

Combinatorics · Mathematics 2017-10-31 Arthur Hoffmann-Ostenhof , Tomáš Kaiser , Kenta Ozeki

A link in $S^3$ is called real algebraic if it is the link of an isolated singularity of a polynomial map from $\mathbb{R}^4$ to $\mathbb{R}^2$. It is known that every real algebraic link is fibered and it is conjectured that the converse…

Geometric Topology · Mathematics 2025-05-21 Benjamin Bode

The Temperley--Lieb algebra is a finite dimensional associative algebra that arose in the context of statistical mechanics and occurs naturally as a quotient of the Hecke algebra arising from a Coxeter group of type $A$. It is often…

Quantum Algebra · Mathematics 2024-02-12 Dana C. Ernst , Michael G. Hastings , Sarah K. Salmon

Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…

Geometric Topology · Mathematics 2007-05-23 Thomas A. Gittings