English
Related papers

Related papers: Arithmetic Kei Theory

200 papers

Kempe equivalence is a classical and fundamental notion in graph coloring theory. In the present paper we establish a connection between Kempe equivalence and quadratic stable set ring, which are toric rings associated to graphs. In fact,…

Combinatorics · Mathematics 2026-04-09 Hidefumi Ohsugi , Akiyoshi Tsuchiya

Recently, Alon, Cambie, and Kang introduced asymmetric list coloring of bipartite graphs, where the size of each vertex's list depends on its part. For complete bipartite graphs, we fix the list sizes of one part and consider the resulting…

Combinatorics · Mathematics 2023-08-29 Daniel G. Zhu

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

Combinatorics · Mathematics 2012-04-06 Eric Babson , Matthias Beck

A torti-rational knot, denoted by K(2a,b|r), is a knot obtained from the 2-bridge link B(2a,b) by applying Dehn twists an arbitrary number of times, r, along one component of B(2a,b). We determine the genus of K(2a,b|r) and solve a question…

Geometric Topology · Mathematics 2008-10-23 M. Hirasawa , K. Murasugi

We discuss the relationship between two analogues in a 3-manifold of the set of prime ideals in a number field. We prove that if $(K_i)_{i\in \mathbb{N}_{>0}}$ is a sequence of knots obeying the Chebotarev law in the sense of Mazur and…

Geometric Topology · Mathematics 2021-03-09 Jun Ueki

Construction of representations of braid group generators from $N$-state vertex models provide an elegant route to study knot and link invariants. Using such a braid group representation, an algebraic formula for the link invariants was put…

High Energy Physics - Theory · Physics 2019-01-11 Saswati Dhara , Romesh K. Kaul , P. Ramadevi , Vivek Kumar Singh

A quandle coloring quiver is a quiver structure, introduced by Karina Cho and Sam Nelson, which is defined on the set of quandle colorings of an oriented knot or link by a finite quandle. We study quandle coloring quivers of (p, 2)-torus…

Geometric Topology · Mathematics 2022-09-13 Jagdeep Basi , Carmen Caprau

The classical invariant theory for the queer Lie superalgebra is an investigation of the $\mathrm{U}(\mathfrak{q}_n)$-invariant sub-superalgebra of the symmetric superalgebra $\mathrm{Sym}(V^{\oplus r}\oplus V^{*\oplus s})$ for…

Representation Theory · Mathematics 2022-09-05 Zhihua Chang , Yongjie Wang

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…

Probability · Mathematics 2024-02-28 Ádám Timár

A systematic study of holomorphic gauge invariant operators in general $\mathcal{N}=1$ quiver gauge theories, with unitary gauge groups and bifundamental matter fields, was recently presented in [1]. For large ranks a simple counting…

High Energy Physics - Theory · Physics 2014-12-19 Paolo Mattioli , Sanjaye Ramgoolam

The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…

General Mathematics · Mathematics 2007-05-23 Dhananjay P. Mehendale

We consider unavoidable chromatic patterns in $2$-colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, extremal graph theory (Tur\'an type problems), zero-sum Ramsey…

Combinatorics · Mathematics 2019-04-09 Yair Caro , Adriana Hansberg , Amanda Montejano

Given a graph $G=(V,E)$ and a proper vertex colouring of $G$, a Kempe chain is a subset of $V$ that induces a maximal connected subgraph of $G$ in which every vertex has one of two colours. To make a Kempe change is to obtain one colouring…

Discrete Mathematics · Computer Science 2015-08-11 Carl Feghali , Matthew Johnson , Daniel Paulusma

Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…

Logic · Mathematics 2023-07-13 M. Malliaris , S. Shelah

A survey of the theory of Kac polynomials for quivers and for curves. In particular, we describe the representation-theoretic meaning of Kac polynomials in terms of Hall algebras, and the geometric meaning of Kac polynomials in relation to…

Representation Theory · Mathematics 2018-02-28 Olivier Schiffmann

A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j with i < j, every vertex of G colored by j has a neighbor with color i. The Grundy chromatic number (G), is the largest integer k for which…

Discrete Mathematics · Computer Science 2014-06-06 Ali Mansouri , Mohamed Salim Bouhlel

In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…

Algebraic Geometry · Mathematics 2025-04-01 Chenjing Bu

A quadratic Lie algebra is a Lie algebra endowed with a symmetric, invariant and non degenerate bilinear form; such a bilinear form is called an invariant metric. The aim of this work is to describe the general structure of those central…

Rings and Algebras · Mathematics 2019-03-29 R. García-Delgado , G. Salgado , O. A. Sánchez-Valenzuela

Quantum K-theory of a smooth projective variety at genus zero is a collection of integers that can be assembled into a generating series $J(Q,q,t)$ that satisfies a system of linear differential equations with respect to $t$ and…

Algebraic Geometry · Mathematics 2022-03-22 Stavros Garoufalidis , Emanuel Scheidegger

For an $r$-regular graph $G$, we define an edge-coloring $c$ with colors from $\{1,2,\cdots,$ $k\}$, in such a way that any vertex of $G$ is incident to at least one edge of each color. The multiset-color $c_m(v)$ of a vertex $v$ is defined…

Combinatorics · Mathematics 2016-11-28 Xueliang Li , Xiaoyu Zhu