Related papers: Dynkin Graphs and Triangle Singularities

Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…

In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…

A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…

In this work, we show that for a certain class of threefolds in positive characteristics, rational-chain-connectivity is equivalent to supersingularity. The same result is known for K3 surfaces with elliptic fibrations. And there are…

Turan's Theorem states that every graph of a certain edge density contains a complete graph $K^k$ and describes the unique extremal graphs. We give a similar Theorem for l-partite graphs. For large l, we find the minimal edge density…

By examining the 3 surface angles which exist at any of the 8 vertices of a Diophantine parallelepiped, and classifying them by the appearance of a right angle, it is discovered that 5 unique classes of Diophantine parallelepipeds exist. It…

For a star-shaped graph, we introduce special characters and study their properties. We decompose special characters into odd and even parts and study their evolution under reflections. We apply the obtained formulas to prove that the…

We construct, on a supersingular K3 surface with Artin invariant 1 in characteristic 2, a set of 21 disjoint smooth rational curves and another set of 21 disjoint smooth rational curves such that each curve in one set intersects exactly 5…

We suggest an invariant way to enumerate nodal and nodal-cuspidal real deformations of real plane curve singularities. The key idea is to assign Welschinger signs to the counted deformations. Our invariants can be viewed as a local version…

In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving…

We study tilting complexes over preprojective algebras of Dynkin type. We classify all tilting complexes by giving a bijection between tilting complexes and the braid group of the corresponding folded graph. In particular, we determine the…

We study equi-singular strata of plane curves with two singular points of prescribed types. The method of the previous work [Kerner06] is generalized to this case. In particular we consider the enumerative problem for plane curves with two…

In this paper we solve the problem of analytic classification of plane curves singularities with two branches by presenting their normal forms. This is accomplished by means of a new analytic invariant that relates vectors in the tangent…

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly…

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove…

We consider the Berglund-H\"ubsch transpose of a bimodal invertible polynomial and construct a triangulated category associated to the compactification of a suitable deformation of the singularity. This is done in such a way that the…

Adinkras are diagrams that describe many useful supermultiplets in D=1 dimensions. We show that the topology of the Adinkra is uniquely determined by a doubly even code. Conversely, every doubly even code produces a possible topology of an…