中文
相关论文

相关论文: A Count of Classical Field Theory Graphs

200 篇论文

A graph G on n vertices is said to be extendable if G can be modified to form a new graph H on more than n vertices, while preserving the degrees of the vertices common to G and H. The added vertices all have the same degree and we define…

组合数学 · 数学 2018-03-09 Ghurumuruhan Ganesan

In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Alex Shkotin

Gauge theories can be described by assigning a vector space V(x) to each space time point x. A common set of complex numbers, C, is usually assumed to be the set of scalars for all the V{x}. This is expanded here to assign a separate set of…

数学物理 · 物理学 2011-07-11 Paul Benioff

In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…

离散数学 · 计算机科学 2021-01-27 Shen Zheng

An approach to field theory is studied in which fields are comprised of $N$ constituent random neurons. Gaussian theories arise in the infinite-$N$ limit when neurons are independently distributed, via the Central Limit Theorem, while…

高能物理 - 理论 · 物理学 2021-12-10 James Halverson

First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…

群论 · 数学 2007-05-23 Jason Fulman

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

组合数学 · 数学 2024-09-06 John Talbot , Jun Yan

The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.

组合数学 · 数学 2015-05-25 James H. Schmerl

Classical field theory is considered as a theory of unparametrized surfaces embedded in a configuration space, which accommodates, in a symmetric way, spacetime positions and field values. Dynamics is defined via the (Hamiltonian)…

数学物理 · 物理学 2016-02-02 Vaclav Zatloukal

We argue that the quantized non-Abelian gauge theory can be obtained as the infrared limit of the corresponding classical gauge theory in a higher dimension. We show how the transformation from classical to quantum field theory emerges, and…

高能物理 - 理论 · 物理学 2015-06-26 T. S. Biro , S. G. Matinyan , B. Muller

A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…

组合数学 · 数学 2015-06-17 Nathan Reff

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

数论 · 数学 2020-12-24 Anders Karlsson , Gaëtan Kuhn

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

组合数学 · 数学 2017-09-12 Christian Avart , Bill Kay , Christian Reiher , Vojtěch Rödl

Computers and algorithms play an ever-increasing role in obtaining new results in graph theory. In this survey, we present a broad range of techniques used in computer-assisted graph theory, including the exhaustive generation of all…

组合数学 · 数学 2025-08-29 Jorik Jooken

Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different…

神经与进化计算 · 计算机科学 2017-02-23 Moshe Looks , Marcello Herreshoff , DeLesley Hutchins , Peter Norvig

The atom graph of a graph is the graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient…

数据结构与算法 · 计算机科学 2016-07-12 Anne Berry , Geneviève Simonet

In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…

组合数学 · 数学 2024-05-14 Johann A. Makowsky

We regard a classical field as a medium and so the additional parameter, the velocity of a field,appears. If the one regard as a potential of same field then the self-energies of the fields became finite. Electromagnetic, mechanical,…

数学物理 · 物理学 2019-05-09 V. Radchenko

We do a critical review of the Faraday-Maxwell concept of classical field and of its quantization process. With the hindsight knowledge of the essentially quantum character of the interactions, we use a naive classical model of field, based…

高能物理 - 理论 · 物理学 2008-02-03 Manoelito M. de Souza

A gauge system is a classical field theory where among the fields there are connections in a principal G-bundle over the space-time manifold and the classical action is either invariant or transforms appropriately with respect to the action…

数学物理 · 物理学 2015-05-19 N. Reshetikhin