English
Related papers

Related papers: Signed permutations and the four color theorem

200 papers

We identify a natural analytic continuation in four dimensions from Minkowski signature to a signature with two time-like momentum components. For two, three and four-point diagrams at fixed external momenta, this continuation can be…

High Energy Physics - Theory · Physics 2013-05-29 Stanislav Srednyak , George Sterman

We say that a signed graph is $k$-critical if it is not $k$-colorable but every one of its proper subgraphs is $k$-colorable. Using the definition of colorability due to Naserasr, Wang, and Zhu that extends the notion of circular…

Combinatorics · Mathematics 2023-09-11 Laurent Beaudou , Penny Haxell , Kathryn Nurse , Sagnik Sen , Zhouningxin Wang

A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…

Combinatorics · Mathematics 2011-06-29 Hannah Jackson , Kathryn Nyman , Les Reid

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

Group Theory · Mathematics 2020-10-20 Robert Shwartz , Vadim E. Levit

A signed graph is a pair $(G,\Sigma)$, where $G=(V,E)$ is a graph (in which parallel edges are permitted, but loops are not) with $V=\{1,\ldots,n\}$ and $\Sigma\subseteq E$. The edges in $\Sigma$ are called odd and the other edges of $E$…

Combinatorics · Mathematics 2020-02-24 Marina Arav , Frank J. Hall , Zhongshan Li , Hein van der Holst

We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…

Combinatorics · Mathematics 2015-03-27 Ademir Hujdurović , Klavdija Kutnar , Dave Witte Morris , Joy Morris

A method to obtain explicit and complete topological solution of SU(2) Chern-Simons theory on $S^3$ is developed. To this effect the necessary aspects of the theory of coloured-oriented braids and duality properties of conformal blocks for…

High Energy Physics - Theory · Physics 2009-10-22 R. K. Kaul

Given a signed bipartite graph $(B, \pi)$ of negative girth $2k$, we present a necessary and sufficient condition for it to have the following property: each signed bipartite graph $(G, \sigma)$ whose negative girth is at least $2k$ and…

Combinatorics · Mathematics 2026-01-06 Meirun Chen , Reza Naserasr

We give a characterization of when a signed graph $G$ with a pair of distinguished edges $e_1, e_2 \in E(G)$ has the property that all cycles containing both $e_1$ and $e_2$ have the same sign. This answers a question of Zaslavsky.

Combinatorics · Mathematics 2023-06-12 Matt DeVos , Kathryn Nurse

We show that the number of signed permutations avoiding 1234 equals the number of signed permutations avoiding 2143 (also called vexillary signed permutations), resolving a conjecture by Anderson and Fulton. The main tool that we use is the…

Combinatorics · Mathematics 2020-09-07 Yibo Gao , Kaarel Hänni

The group $S_4$ of permutations on four elements has an irreducible representation corresponding to the partition 4=2+2. This representation appears in several different mathematical contexts: the Jacobi identity of Lie algebras; the…

High Energy Physics - Theory · Physics 2014-04-04 Barak Kol , Ruth Shir

A signed graph is a simple graph with two types of edges: positive and negative edges. Switching a vertex $v$ of a signed graph corresponds to changing the type of each edge incident to $v$. A homomorphism from a signed graph $G$ to another…

Combinatorics · Mathematics 2021-05-13 Fabien Jacques , Alexandre Pinlou

The theory of signature invariants of links in rational homology spheres is applied to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, an explicit formula is derived to compute…

Geometric Topology · Mathematics 2007-05-23 Jae Choon Cha , Ki Hyoung Ko

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{\sigma,\sigma^*}$ between spanning trees of $G$ and $(\sigma,\sigma^*)$-compatible orientations, where…

Combinatorics · Mathematics 2023-06-14 Changxin Ding

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

Geometric Topology · Mathematics 2018-12-24 Leslie Colton , Cory Glover , Mark Hughes , Samantha Sandberg

A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…

Combinatorics · Mathematics 2020-02-05 Jake Huryn

The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…

Dynamical Systems · Mathematics 2016-08-08 Primitivo B. Acosta-Humánez , Oscar E. Martínez-Castiblanco

We define and study a new class of 4d N=1 superconformal quiver gauge theories associated with a planar bipartite network. While UV description is not unique due to Seiberg duality, we can classify the IR fixed points of the theory by a…

High Energy Physics - Theory · Physics 2015-03-20 Dan Xie , Masahito Yamazaki

Given a knot $K$ inside an integer homology sphere $Y$, the Casson-Lin-Herald invariant can be interpreted as a signed count of conjugacy classes of irreducible representations of the knot complement into $SU(2)$ which map the meridian of…

Geometric Topology · Mathematics 2021-02-02 Mariano Echeverria

In this note, we revisit the notion of strong set-colorings introduced by Hegde (2009) and completed by equivalences due to Boutin et al. (2010) and provide a necessary and sufficient \emph{Steiner packing} characterisation: a finite graph…

Combinatorics · Mathematics 2025-08-20 Kumar Abhishek