English
Related papers

Related papers: Integrable deformations of systems on graphs with …

200 papers

A common choice for the evolution of the knotted graphs in loop quantum gravity is to use the Pachner moves, adapted to graphs from their dual triangulations. Here, we show that the natural way to consistently use these moves is on framed…

General Relativity and Quantum Cosmology · Physics 2024-06-06 Daniel Cartin

A subcycle of an Eulerian circuit is a sequence of edges that are consecutive in the circuit and form a cycle. We characterise the quartic planar graphs that admit Eulerian circuits avoiding 3-cycles and 4-cycles. From this, it follows that…

Combinatorics · Mathematics 2019-10-08 Jane Tan

We prove that the complete graph with a hole $K_{u+w}-K_u$ can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, each cycle has length at most $\min(u,w)$, and the longest…

Combinatorics · Mathematics 2016-03-15 Daniel Horsley , Rosalind A. Hoyte

In 2012, L\'ev\^eque, Maffray, and Trotignon conjectured that each graph $G$ that contains no induced subdivision of $K_4$ is $4$-colorable. In this paper, we prove that this conjecture holds when $G$ contains a $K_{1,2,3}$.

Combinatorics · Mathematics 2023-05-09 Rong Chen

We prove a decomposition theorem for the class of triangle-free graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph. We prove that every graph of girth at least~5 in this class is…

Combinatorics · Mathematics 2020-12-01 Nicolas Trotignon , Kristina Vušković

We study the generation property for a fourth order operator in divergence or in non divergence form with suitable Neumann boundary conditions. As a consequence we obtain the well posedness for the parabolic equations governed by these…

Analysis of PDEs · Mathematics 2023-02-10 Alessandro Camasta , Genni Fragnelli

In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…

Quantum Algebra · Mathematics 2010-08-25 Jim Conant , Karen Vogtmann

A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\mathcal{D}$ of $G$ such that every subgraph $H \in \mathcal{D}$ is locally irregular.…

Combinatorics · Mathematics 2019-02-05 Carla Negri Lintzmayer , Guilherme Oliveira Mota , Maycon Sambinelli

In this paper, we give a sufficient and necessary condition for a $k$-extendable graph to be $2k$-factor-critical when $k=\nu/4$, and prove some results on independence numbers in $n$-factor-critical graphs and $k\frac{1}{2}$-extendable…

Combinatorics · Mathematics 2010-11-16 Zan-Bo Zhang , Dingjun Lou , Xiaoyan Zhang

A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph $G$ is such an (improper) edge-coloring that the edges of any fixed color induce a locally irregular…

This paper proves the following result: If $G$ is a planar graph and $L$ is a $4$-list assignment of $G$ such that $|L(x) \cap L(y)| \le 2$ for every edge $xy$, then $G$ is $L$-colourable. This answers a question asked by Kratochv\'{i}l,…

Combinatorics · Mathematics 2022-05-25 Xuding Zhu

An oscillation formula is established for the $k$-th eigenvector (assumed to be simple and with non-zero entries) of a weighted graph operator. The formula directly attributes the number of sign changes exceeding $k-1$ to the cycles in the…

Spectral Theory · Mathematics 2025-07-31 Gregory Berkolaiko , Jared C. Bronski , Mark Goresky

Perturbation of logarithmic conformal field theories is investigated using Zamolodchikov's method. We derive conditions for the perturbing operator, such that the perturbed model be integrable. We also consider an example where integrable…

High Energy Physics - Theory · Physics 2008-11-26 M. A. Rajabpour , S. Rouhani

We observe that under certain conditions on the Lyapunov exponents a semi-invertible cocycle is, indeed, invertible. As a consequence, if a semi-invertible cocycle generated by a H\"{o}lder continuous map $A:M\to M(d, \mathbb{R})$ over a…

Dynamical Systems · Mathematics 2019-09-12 Lucas Backes

A defective $k$-coloring is a coloring on the vertices of a graph using colors $1,2, \dots, k$ such that adjacent vertices may share the same color. A $(d_1,d_2)$-\emph{coloring} of a graph $G$ is a defective $2$-coloring of $G$ such that…

Combinatorics · Mathematics 2025-01-14 Pongpat Sittitrai , Wannapol Pimpasalee , Kittikorn Nakprasit

We compute structure constants in N=4 SYM at one loop using Integrability. This requires having full control over the two loop eigenvectors of the dilatation operator for operators of arbitrary size. To achieve this, we develop an algebraic…

High Energy Physics - Theory · Physics 2012-05-25 Nikolay Gromov , Pedro Vieira

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

General Topology · Mathematics 2009-10-20 Yevgen Polulyakh , Iryna Yurchuk

In this paper, we prove that simple affine vertex operator algebras with positive integral levels admit only trivial first-order deformations. Therefore, the deformation rigidity conjecture of strongly rational vertex operator algebras…

Quantum Algebra · Mathematics 2026-01-21 Andrew R. Linshaw , Fei Qi

We study geometric properties of varieties associated with invariant subspaces of nilpotent operators. There are reductive algebraic groups acting on these varieties. We give dimensions of orbits of these actions. Moreover, a combinatorial…

Representation Theory · Mathematics 2019-06-27 Justyna Kosakowska , Markus Schmidmeier

The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…

Information Theory · Computer Science 2009-05-19 Narayana Santhanam , Martin J. Wainwright
‹ Prev 1 3 4 5 6 7 10 Next ›