Related papers: Dynkin Graphs and Triangle Singularities
Landau's work on the singularities of Feynman diagrams suggests that they can only be of three types: either poles, logarithmic divergences, or the roots of quadratic polynomials. On the other hand, many Feynman integrals exist whose…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
I use matrix factorizations to describe branes at simple singularities as they appear in elliptic fibrations of local F-theory models. Each node of the corresponding Dynkin diagrams of the ADE-type singularities is associated with one…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
By using superisolated surface singularities whose link is a rational homology sphere we give counterexamples to some of the most important conjetures concernig invariants of normal surface singularities.
We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…
We classify, up to some lattice-theoretic equivalence, all possible configurations of rational double points that can appear on a surface whose minimal resolution is a complex Enriques surface.
We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the Standard Model in dimensional regularization. After highlighting issues in the textbook treatment…
The principles behind the sharp, singular structures in a crumpled sheet are well understood. Here we discuss more general ways of exploiting such sharp structures to control the shape of a sheet by deforming or forcing it elsewhere. Often,…
In this paper, we give the generic classification of the singularities of 3-parameter line congruences in $\mathbb{R}^4$. We also classify the generic singularities of Blaschke (affine) normal congruences.
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
Extending the well-known star-comb lemma for infinite graphs, we characterise the graphs that do not contain an infinite comb or an infinite star, respectively, attached to a given set of vertices. We offer several characterisations: in…
In this paper, we will interest in finding the number of zeros of the quadratic forms over finite fields. We will apply the tool for finding the number of rational points of supersingular curves in [6]. We will give some more tools for…
A $d$-regular graph on $n$ nodes has at most $T_{\max} = \frac{n}{3} \tbinom{d}{2}$ triangles. We compute the leading asymptotics of the probability that a large random $d$-regular graph has at least $c \cdot T_{\max}$ triangles, and…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Triple orthogonal coordinate systems having coordinate lines as circles or straight lines are considered. Technically, they are represented by trilinear rational quaternionic maps and are called Dupin cyclidic cubes, naturally generalizing…
Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…