English
Related papers

Related papers: Cartan coherent configurations

200 papers

A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…

Group Theory · Mathematics 2007-05-23 Jonathan P. McCammond , Daniel T. Wise

A 2-group is a "categorified" version of a group, in which the underlying set G has been replaced by a category and the multiplication map has been replaced by a functor. Various versions of this notion have already been explored; our goal…

Quantum Algebra · Mathematics 2007-05-23 John C. Baez , Aaron D. Lauda

A linear connection on a Lie algebroid is called a Cartan connection if it is suitably compatible with the Lie algebroid structure. Here we show that a smooth connected manifold $M$ is locally homogeneous - i.e., admits an atlas of charts…

Differential Geometry · Mathematics 2013-11-27 Anthony D. Blaom

Let $G$ be a connected complex semisimple Lie group, $\Gamma$ be a cocompact, irreducible and torsionless lattice in $G$ and $K$ be a maximal compact subgroup of $G$. Assume $\Gamma$ acts by left multiplication and $K$ acts by right…

Complex Variables · Mathematics 2023-09-13 Pritthijit Biswas

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…

Logic · Mathematics 2013-04-05 Alessandro Berarducci , Marcello Mamino

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

Rings and Algebras · Mathematics 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

The {\em disjointness graph} $G=G({\cal S})$ of a set of segments ${\cal S}$ in $R^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We…

Combinatorics · Mathematics 2021-11-12 Janos Pach , Gabor Tardos , Geza Toth

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

Ternary coherent configurations are, on the one hand, a special case of multidimensional coherent configurations introduced by L. Babai (2016), and, on the other hand, a natural generalization of association schemes on triples introduced by…

Combinatorics · Mathematics 2026-04-21 Gang Chen , Qing Ren , Ilia Ponomarenko

Let $G$ be a group acting on a finite set $\Omega$. Then $G$ acts on $\Omega\times \Omega$ by its entry-wise action and its orbits form the basis relations of a coherent configuration (or shortly scheme). Our concern is to consider what…

Combinatorics · Mathematics 2010-06-29 Mitsugu Hirasaka , Reza Sharafdini

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

Group Theory · Mathematics 2018-02-27 Attila Nagy

We present an explicit numerical method to obtain the Cartan-Khaneja-Glaser decomposition of a general element G of SU(2^N) in terms of its `Cartan' and `non-Cartan' components. This effectively factors G in terms of group elements that…

Quantum Physics · Physics 2011-09-30 Henrique N. Sá Earp , Jiannis K. Pachos

Given a projective algebraic set X, its dual graph G(X) is the graph whose vertices are the irreducible components of X and whose edges connect components that intersect in codimension one. Hartshorne's connectedness theorem says that if…

Commutative Algebra · Mathematics 2022-08-25 Bruno Benedetti , Matteo Varbaro

In his 1910 paper, \'Elie Cartan gave a tour-de-force solution to the (local) equivalence problem for generic rank 2 distributions on 5-manifolds, i.e. $(2,3,5)$-distributions. From a modern perspective, these structures admit equivalent…

Differential Geometry · Mathematics 2022-05-09 Dennis The

We obtain an explicit characterization of the stable points of the action of G=SL(2,C) on the cartesian product G^n by simultaneous conjugation on each factor, in terms of the corresponding invariant functions, and derive from it a simple…

Geometric Topology · Mathematics 2021-10-19 Carlos A. A. Florentino

A group pair $(G, X)$ consists of a group $G$ together with a $G$-set $X$. Such a pair encodes properties of $G$ relative to the stabilisers of points in $X$. In this paper, we show how to combine properties of group pairs and their…

Group Theory · Mathematics 2025-10-29 Andrei Jaikin-Zapirain , Marco Linton , Pablo Sánchez-Peralta

If $L$ is a semisimple Lie algebra of vector fields on R^N with a split Cartan subalgebra C, then it is proved that the dimension of the generic orbit of C coincides with the dimension of C. As a consequence one obtains a local canonical…

Representation Theory · Mathematics 2016-12-28 Hassan Azad , Indranil Biswas , Fazal M. Mahomed

We develop practical tools for analyzing the configuration set $F(G,k)$ of $k\geq 2$ distinct elements in a group $G$. We apply our results to design homogeneous linear systems in $\mathbb{F}_q$ that admit nontrivial solutions. Furthermore,…

Combinatorics · Mathematics 2026-04-07 Cesar A. Ipanaque Zapata , Alex Freitas de Campos

First, we prove that the set of $n\times n$ complex matrices is the closure of a certain open subset whose elements have a very specific canonical form under congruence, which is uniquely determined up to the values of some parameters, but…

Spectral Theory · Mathematics 2025-12-16 Fernando De Terán , Froilán M. Dopico

A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…

Combinatorics · Mathematics 2007-05-23 Vadim E. Levit , Eugen Mandrescu