English
Related papers

Related papers: A generalized Beraha conjecture for non-planar gra…

200 papers

We present exact calculations of the zero-temperature partition function $Z(G,q,T=0)$ and ground-state degeneracy $W(\{G\},q)$ for the $q$-state Potts antiferromagnet on a number of families of graphs $G$ for which (generalizing $q$ from…

Statistical Mechanics · Physics 2015-06-25 Robert Shrock , Shan-Ho Tsai

The zero-temperature Glauber dynamics is used to investigate the persistence probability $P(t)$ in the Potts model with $Q=3,4,5,7,9,12,24,64, 128$, $256, 512, 1024,4096,16384 $,..., $2^{30}$ states on {\it directed} and {\it undirected}…

Statistical Mechanics · Physics 2009-11-13 F. P. Fernandes , F. W. S. Lima

We consider the Potts model with $q$ colors on a sequence of weighted graphs with adjacency matrices $A_n$, allowing for both positive and negative weights. Under a mild regularity condition the mean-field prediction for the log partition…

Probability · Mathematics 2016-05-06 Anirban Basak , Sumit Mukherjee

Let $G$ be a graph and let $C$ be a color set of cardinality $k$. Suppose $c \colon V(G) \to C$ is a (not necessarily proper) vertex coloring whose all color classes are $V_1$, $V_2$, $\dots$, $V_k$, each of which is nonempty. The vertex…

Combinatorics · Mathematics 2025-12-15 Saeed Shaebani

Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a…

Combinatorics · Mathematics 2015-02-03 Bobby DeMarco , Amanda Redlich

The Generalized Parton Distributions (GPDs) of the nucleon are analyzed within the relativistic constituent quark model formulated on the light-front. It is shown that the matrix elements of the plus component of the one-body vector current…

High Energy Physics - Phenomenology · Physics 2017-08-23 Silvano Simula

Let G be a finite connected graph. The Kirchhoff polynomial of G is a certain homogeneous polynomial whose degree is equal to the first betti number of G. These polynomials appear in the study of electrical circuits and in the evaluation of…

Algebraic Geometry · Mathematics 2007-05-23 Prakash Belkale , Patrick Brosnan

Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…

Complex Variables · Mathematics 2007-05-23 Alain Escassut , Eberhard Mayerhofer

A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1 <= i <= l. In this paper, we focus on…

Combinatorics · Mathematics 2013-06-06 Mickael Montassier , Pascal Ochem

We prove several theorems concerning Tutte polynomials $T(G,x,y)$ for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts…

Mathematical Physics · Physics 2007-05-23 Shu-Chiuan Chang , Robert Shrock

In the example of complex grassmannians, we demonstrate various techniques available for computing genus-0 K-theoretic GW-invariants of flag manifolds and more general quiver varieties. In particular, we address explicit reconstruction of…

Algebraic Geometry · Mathematics 2021-03-01 Alexander Givental , Xiaohan Yan

Recently, Andrews and Bachraoui considered a generating function $F_{k,m}(q)$ associated with certain two-color partitions, and conjectured that this function has non-negative coefficients for $m=1$. They showed this property for $1 \leq k…

Number Theory · Mathematics 2026-01-08 Koustav Banerjee , Kathrin Bringmann , William J. Keith

The dual stable Grothendieck polynomials are a deformation of the Schur functions, originating in the study of the K-theory of the Grassmannian. We generalize these polynomials by introducing a countable family of additional parameters, and…

Combinatorics · Mathematics 2020-09-29 Pavel Galashin , Darij Grinberg , Gaku Liu

Combining tree decomposition and transfer matrix techniques provides a very general algorithm for computing exact partition functions of statistical models defined on arbitrary graphs. The algorithm is particularly efficient in the case of…

Mathematical Physics · Physics 2015-05-18 Andrea Bedini , Jesper Lykke Jacobsen

partial abstract: The $q$-state Potts model partition function (equivalent to the Tutte polynomial) for a lattice strip of fixed width $L_y$ and arbitrary length $L_x$ has the form…

Statistical Mechanics · Physics 2009-10-31 Shu-Chiuan Chang , Robert Shrock

Let $G$ be a graph without 4-cycles and 5-cycles. We show that the problem to determine whether $G$ is $(0,k)$-colorable is NP-complete for each positive integer $k.$ Moreover, we construct non-$(1,k)$-colorable planar graphs without…

Combinatorics · Mathematics 2016-12-01 Pongpat Sittitrai , Kittikorn Nakprasit

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

Operator Algebras · Mathematics 2009-04-09 Jan Willem de Jong

The KP equation is a nonlinear dispersive wave equation which provides an excellent model for resonant interactions of shallow-water waves. It is well known that regular soliton solutions of the KP equation may be constructed from points in…

Exactly Solvable and Integrable Systems · Physics 2018-08-07 Rachel Karpman , Yuji Kodama

We consider a special class of generalized Paley graphs over finite fields, namely the Cayley graphs with vertex set $\mathbb{F}_{q^m}$ and connection set the nonzero $(q^\ell+1)$-th powers in $\mathbb{F}_{q^m}$, as well as their…

Combinatorics · Mathematics 2024-07-25 Ricardo A. Podestá , Denis E. Videla

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

Data Structures and Algorithms · Computer Science 2018-01-22 Joergen Bang-Jensen , Stéphane Bessy
‹ Prev 1 3 4 5 6 7 10 Next ›