Related papers: A Count of Classical Field Theory Graphs
We explore a field theoretical approach to quantum computing and control. This book consists of three parts. The basics of systems theory and field theory are reviewed in Part I. In Part II, a gauge theory is reinterpreted from a systems…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
In this note we classify when a skew Schur function is a positive linear combination of power sum symmetric functions. We then use this to determine precisely when any scalar multiple of a skew Schur function is the chromatic symmetric…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
We study the enumeration of bargraphs with respect to some corner statistics. We find generating functions for the number of bargraphs that tracks the corner statistics of interest, the number of cells, and the number of columns. The…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
The slope variety of a graph is an algebraic set whose points correspond to drawings of a graph. A complement-reducible graph (or cograph) is a graph without an induced four-vertex path. We construct a bijection between the zeroes of the…
Gravity theories with non-minimally coupled scalar fields are used as characteristic examples in order to demonstrate the challenges, pitfalls and future perspectives of considering alternatives to general relativity. These lecture notes…
We introduce the notion of a diagram category and discuss its application to the invariant theory of classical groups and super groups, with some indications concerning extensions to quantum groups and quantum super groups. Tensor functors…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for formalizing algorithms that manipulate mathematical expressions. A theory…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We introduce a method that generates invariant functions from perturbative classical field theories depending on external parameters. Applying our methods to several field theories such as abelian BF, Chern-Simons and 2-dimensional…
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.