English
Related papers

Related papers: Small-tau expansion for the form factor of glued q…

200 papers

Tuza (A conjecture, in Proceedings of the Colloquia Mathematica Societatis Janos Bolyai, 1981) conjectured that $\tau(G) \le 2\nu(G)$ for all graphs $G$, where $\tau(G)$ is the minimum size of an edge set whose removal makes $G$…

Combinatorics · Mathematics 2022-05-24 Kazuhiro Nomoto , Jorn van der Pol

We study the non-perturbative effects of the global features of the configuration space for SU(2) gauge theory on the three-sphere. The strategy is to reduce the full problem to an effective theory for the dynamics of the low-energy modes.…

High Energy Physics - Lattice · Physics 2009-10-28 Bas van den Heuvel

Based on the Gor'kov formalism for a clean s-wave superconductor, we develop an extended version of the single-band Ginzburg-Landau (GL) theory by means of a systematic expansion in the deviation from the critical temperature T_c, i.e.,…

Superconductivity · Physics 2012-03-16 A. V. Vagov , A. A. Shanenko , M. V. Milošević , V. M. Axt , F. M. Peeters

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

Combinatorics · Mathematics 2026-02-17 Michelle Delcourt , Catherine Greenhill , Mikhail Isaev , Bernard Lidický , Luke Postle

We calculate the quantum corrections to the two-point function of four dimensional topologically massive non-Abelian vector fields at one loop order for $SU(N)$ gauge theory in Feynman-'t Hooft gauge. We calculate the beta function of the…

High Energy Physics - Phenomenology · Physics 2014-07-15 Debmalya Mukhopadhyay , Amitabha Lahiri

We introduce a Wilson line distribution function bar{W}_tau(v) to study gluon saturation at small Feynman x_F, or large tau=ln(1/x_F). This new distribution can be obtained from the distribution W_tau(alpha) of the Color Glass Condensate…

High Energy Physics - Phenomenology · Physics 2009-11-07 C. S. Lam , Gregory Mahlon , Wei Zhu

We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…

Mathematical Physics · Physics 2019-12-10 Pavel Exner , Olaf Post

For non-Hermitian equilateral q-pointed star-shaped quantum graphs of paper I [Can. J. Phys. 90, 1287 (2012), arXiv 1205.5211] we show that due to certain dynamical aspects of the model as controlled by the external, rotation-symmetric…

Quantum Physics · Physics 2015-07-14 Miloslav Znojil

In this paper we extend the study of total graphs $\tau(R)$ to non-commutative finite rings $R$. We prove that $\tau(R)$ is connected if and only if $R$ is not local and we see that in that case $\tau(R)$ is always Hamiltonian. We also find…

Rings and Algebras · Mathematics 2014-01-10 David Dolžan , Polona Oblak

2-color QCD, i. e. QCD with the gauge group SU(2), is the simplest non-Abelian gauge theory without sign problem at finite quark density. Therefore its study on the lattice is a benchmark for other non-perturbative approaches at finite…

High Energy Physics - Lattice · Physics 2018-04-18 Ouraman Hajizadeh , Tamer Boz , Axel Maas , Jon-Ivar Skullerud

In the limit of the lattice spacing going to zero, we consider the dimer model on isoradial graphs in the presence of singular $SL(N,\mathbb{C})$ gauge fields flat away from a set of punctures. We consider the cluster expansion of this…

High Energy Physics - Theory · Physics 2023-10-26 Sri Tata

Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Suppose $\Gamma$ is undirected and non-bipartite. Let $\mu$ (resp. $\mu_2$) denote the smallest…

Combinatorics · Mathematics 2023-12-12 Jyoti Prakash Saha

A close study is made of the static structure factor for graphene in a magnetic field at integer filling factors nu, with focus on revealing possible signatures of "relativistic" quantum field theory in the low-energy physics of graphene.…

Mesoscale and Nanoscale Physics · Physics 2009-11-13 K. Shizuya

We theoretically implement a strategy from quantum computation architectures to simulate Stuart-Landau oscillator dynamics in all-to-all connected networks, also referred to as complete graphs. The technique builds upon the triad structure…

Quantum Physics · Physics 2023-01-31 Stella L. Harrison , Helgi Sigurdsson , Pavlos G. Lagoudakis

Baker and Rumely's tau lower bound conjecture claims that if the tau constant of a metrized graph is divided by its total length, this ratio must be bounded below by a positive constant for all metrized graphs. We construct several families…

Combinatorics · Mathematics 2014-05-28 Zubeyir Cinkir

Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…

Probability · Mathematics 2014-09-12 Adrien Joseph

The main result of the article is validity of the limiting absorption principle and thus absence of the singular continuous spectrum for compact quantum graphs with several infinite leads attached. The technique used involves…

Mathematical Physics · Physics 2007-05-23 Beng-Seong Ong

We re-examine the perturbative properties of four-dimensional non-commutative QED by extending the pinch techniques to the theta-deformed case. The explicit independence of the pinched gluon self-energy from gauge-fixing parameters, and the…

High Energy Physics - Theory · Physics 2009-11-11 Nicola Caporaso , Sara Pasquetti

We determine the minimum size of $n$-factor-critical graphs and that of $k$-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of $k$-extendable non-bipartite graphs for…

Combinatorics · Mathematics 2017-07-25 Zanbo Zhang , Xiaoyan Zhang , Dingjun Lou , Xuelian Wen

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…

Combinatorics · Mathematics 2015-09-22 Eckhard Steffen