English
Related papers

Related papers: Homogeneous coherent configurations from spherical…

200 papers

The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs…

Combinatorics · Mathematics 2013-08-05 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

Let ${\cal M}$ denote the Bose--Mesner algebra of a commutative $d$-class association scheme ${\mathfrak X}$ (not necessarily symmetric), and $\Gamma$ denote a (strongly) connected (directed) graph with adjacency matrix $A$. Under the…

Combinatorics · Mathematics 2023-12-04 Giusy Monzillo , Safet Penjić

By choosing a dynamical system with d different couplings, one can rearrange a system based on the graph with given vertex dependent on the dynamical system elements. The relation between the dynamical elements (coupling) is replaced by a…

Chaotic Dynamics · Physics 2016-09-08 M. A. Jafarizadeh , S. Behnia , E. Faizi , S. Ahadpour

We present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number, as is the case in many fluid mechanics applications of practical interest. The method, based on principles…

Fluid Dynamics · Physics 2017-03-08 Kristy L. Schlueter-Kuck , John O. Dabiri

We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the…

Combinatorics · Mathematics 2026-04-02 Tilen Marc

Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…

Combinatorics · Mathematics 2018-11-30 Gang Chen , Ilia Ponomarenko

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

A (di)graph $\Gamma$ generates a commutative association scheme $\mathfrak{X}$ if and only if the adjacency matrix of $\Gamma$ generates the Bose-Mesner algebra of $\mathfrak{X}$. In [17, Theorem 1.1], Monzillo and Penji\'{c} proved that,…

Combinatorics · Mathematics 2025-02-24 Yuefeng Yang

An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility…

Logic · Mathematics 2020-02-26 Clinton T. Conley , Andrew S. Marks , Spencer T. Unger

In this work we define the trajectory coset of an affine map and use it to study the similarity classes of affine maps. We use the trajectory coset, a tool which allows us to gain a deeper understanding of the interplay between geometry…

Group Theory · Mathematics 2020-09-15 Arieh Yakir

We investigate the Bose-Einstein Condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. The resulting topological model, whose Hamiltonian is the pure hopping one given by the opposite of…

Operator Algebras · Mathematics 2011-06-23 Francesco Fidaleo , Daniele Guido , Tommaso Isola

We consider Bose--Einstein condensation (BEC) on graphs with transient adjacency matrix and obtain a quasi-free state exhibiting BEC is non-factor and decompose into generalized coherent states. We review necessary and sufficient conditions…

Mathematical Physics · Physics 2017-07-19 Tomohiro Kanda

We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with…

Combinatorics · Mathematics 2025-12-11 Sean Dewar , Georg Grasegger , Jan Legerský

A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that…

Combinatorics · Mathematics 2012-10-23 M. Cámara , C. Dalfó , C. Delorme , M. A. Fiol , H. Suzuki

We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical…

Logic in Computer Science · Computer Science 2024-03-19 Robert I. Booth , Titouan Carette , Cole Comfort

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…

General Topology · Mathematics 2023-08-22 Piotr Niemiec

We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their…

Combinatorics · Mathematics 2021-07-27 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno

In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our…

Combinatorics · Mathematics 2012-01-24 Mariusz Grech , Andrzej Kisielewicz
‹ Prev 1 2 3 10 Next ›