English
Related papers

Related papers: Signed quivers, symmetric quivers, and root system…

200 papers

Dynamical systems often admit geometric properties that must be taken into account when studying their behaviour. We show that many such properties can be encoded by means of quiver representations. These properties include classical…

Dynamical Systems · Mathematics 2020-09-22 Eddie Nijholt , Soeren Schwenker , Bob Rink

A signed graph is a graph whose edges are labeled positive or negative. The sign of a cycle is the product of the signs of its edges. Zaslavsky proved in 2012 that, up to switching isomorphism, there are six different signed Petersen…

Combinatorics · Mathematics 2021-10-12 Deepak Sehrawat , Bikash Bhattacharjya

An eigenvalue $\lambda$ of a signed graph $S$ of order $n$ is called a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector $j$. Characterizing signed graphs with exactly $k$ $(1\le k\le n)$ distinct main eigenvalues…

Combinatorics · Mathematics 2026-03-05 Zenan Du , Fenjin Liu , Hechao Liu , Jifu Lin , Wenxu Yang

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman , Rolland Trapp

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…

Rings and Algebras · Mathematics 2024-05-21 Gabriele Rembado

The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…

Algebraic Topology · Mathematics 2023-10-03 Rolando Jimenez , Vladimir Vershinin , Yuri Muranov

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Combinatorics · Mathematics 2009-09-02 Dainis Zeps

Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…

Number Theory · Mathematics 2020-09-28 Hideki Murahara , Tatsushi Tanaka

We introduce the notion of (twisted) quiver representations in abelian categories and study the category of such representations. We construct standard resolutions and coresolutions of quiver representations and study basic homological…

Representation Theory · Mathematics 2018-12-03 Sergey Mozgovoy

In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…

Optimization and Control · Mathematics 2025-02-06 Víctor Blanco , Miguel Martínez-Antón

Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…

Algebraic Topology · Mathematics 2024-07-16 Clémence Chanavat , Amar Hadzihasanovic

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

History and Overview · Mathematics 2024-07-18 Sergey Kurapov , Maxim Davidovsky

We study the representation theory of the nested instantons quiver presented in [1], which describes a particular class of surface defects in four-dimensional supersymmetric gauge theories. We show that the moduli space of its stable…

Algebraic Geometry · Mathematics 2024-11-20 Giulio Bonelli , Nadir Fasola , Alessandro Tanzini

Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…

Combinatorics · Mathematics 2010-11-30 Steven Morse , Elisha Peterson

A signed graph is a graph whose edges are labeled either as positive or negative. The concept of vector valued switching and balancing dimension of signed graphs were introduced by S. Hameed et al. In this paper, we deal with the balancing…

Combinatorics · Mathematics 2023-06-21 Albin Mathew , Germina K. A

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

This article presents an overview of the theory of integrable systems with symmetries, focusing on toric systems, semitoric systems, and their classifications via decorated polygons. We discuss certain one-parameter families of integrable…

Symplectic Geometry · Mathematics 2026-01-21 Joseph Palmer

We study a monoid associated to complex semisimple Lie algebras, called the quantic monoid. Its monoid ring is shown to be isomorphic to a degenerate quantized enveloping algebra. Moreover, we provide normal forms and a straightening…

Quantum Algebra · Mathematics 2007-05-23 Markus Reineke

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

Group Theory · Mathematics 2021-05-26 Tobias Schlemmer

Up to switching isomorphism there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups,…

Combinatorics · Mathematics 2016-10-25 Thomas Zaslavsky