Oliver Knill
YOU?
Author Swipe
Remarks on the Brouwer Conjecture Open
The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if …
Soft Barycentric Refinement Open
The soft Barycentric refinement preserves manifolds with or without boundary. In every dimension larger than one, there is a universal spectral central limiting measure that has affinities with the Barycentric limiting measure one dimensio…
Gauss-Bonnet for Form Curvatures Open
We look at curvatures that are supported on k-dimensional parts of a simplicial complex G. These curvature all satisfy the Gauss-Bonnet theorem, provided that the k-dimensional simplices cover $G$. Each of these curvatures can be written a…
On Symmetries of Finite Geometries Open
The isospectral set of the Dirac matrix D=d+d* consists of orthogonal Q for which Q* D Q is an equivalent Dirac matrix. It can serve as the symmetry of a finite geometry G. The symmetry is a subset of the orthogonal group or unitary group …
Fusion inequality for quadratic cohomology Open
Classical simplicial cohomology on a simplicial complex G deals with functions on simplices x in G. Quadratic cohomology deals with functions on pairs of simplices (x,y) in G x G that intersect. If K,U is a closed-open pair in G, we prove …
Morse and Lusternik-Schnirelmann for graphs Open
Both Morse theory and Lusternik-Schnirelmann theory link algebra, topology and analysis in a geometric setting. The two theories can be formulated in finite geometries like graph theory or within finite abstract simplicial complexes. We wo…
Manifolds from Partitions Open
If f maps a discrete d-manifold G onto a (k+1)-partite complex P then H(G,f,P),the set of simplices x in G such that f(x) contains at least one facet in P defines a (d-k)-manifold.
Discrete Algebraic sets in Discrete Manifolds Open
A discrete d-manifold is a finite simple graph G=(V,E) where all unit spheres are (d-1)-spheres. A d-sphere is a d-manifold for which one can remove a vertex to make it contractible. A graph is contractible if one can remove a vertex with …
Arboricity and Acyclic Chromatic Number Open
A theorem of Hakimi, Mitchem and Schmeichel from 1996 states that the edge arboricity arb(G) of a graph is bounded above by the acyclic chromatic number acy(G). We can improve this HMS inequality by 1, if acy(G) is even. We review also res…
On the arboricity of manifolds Open
The arboricity of a discrete 2-sphere is always 3. The arboricity of any other discrete 2-dimensional surface is always 4. For d-manifolds of dimension larger than 2, the arboricity can be arbitrary large and must be larger than d.
The Three Tree Theorem Open
We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the thr…
On the cohomology of measurable sets Open
If T is an ergodic automorphism of a Lebesgue probability space (X,A,m), the set of coboundries B = db =T(b)+b with symmetric difference + form a subgroup of the set of cocycles A. Using tools from descriptive set theory, Greg Hjorth showe…
Weierstrass elliptic functions for the pendulum Open
The mathematical pendulum is traditionally solved using a Jacobi elliptic functions. We solve it here using the Weierstrass elliptic function. Every initial condition of the pendulum produces an elliptic curve and a point which by the dyna…
Mandelbulb, Mandelbrot, Mandelring and Hopfbrot Open
A topological ring R, an escape set B in R and a family of maps z^d+c defines the degree d Mandelstuff as the set of parameters for which the closure of the orbit of 0 does not intersect R. If B is the complement of a ball of radius 2 in C…
Cohomology of open sets Open
If G is a finite abstract simplicial complex and K is a subcomplex of G and U=G-K is the open complement of K in G, the Betti vectors of K and U and G satisfy the inequality b(G) less or equal b(K)+b(U).
Spectral monotonicity of the Hodge Laplacian Open
If K,G are finite abstract simplicial complexes and K is a subcomplex of G then the eigenvalues of the Hodge Laplacian of K are smaller or equal than the eigenvalues of the Hodge Laplacian of G, provided the eigenvalue lists are padded lef…
Characteristic Topological Invariants Open
The higher characteristics w_m(G) for a finite abstract simplicial complex G are topological invariants that satisfy k-point Green function identities and can be computed in terms of Euler characteristic in the case of closed manifolds, wh…
The Sphere Formula Open
The sphere formula states that in an arbitrary finite abstract simplicial complex, the sum of the Euler characteristic of unit spheres centered at even-dimensional simplices is equal to the sum of the Euler characteristic of unit spheres c…
Finite topologies for finite geometries Open
Without leaving finite mathematics and using finite topological spaces only, we give a definition of homeomorphisms of finite abstract simplicial complexes or finite graphs. Besides exploring the definition in various contexts, we add some…
On Graphs, Groups and Geometry Open
A metric space (X,d) is declared to be natural if (X,d) determines an up to isomorphism unique group structure (X,+) on the set X such that all the group translations and group inversion are isometries. A group is called natural if it emer…
The Babylonian Graph Open
The Babylonian graph B has the positive integers as vertices and connects two if they define a Pythagorean triple. Triangular subgraphs correspond to Euler bricks. What are the properties of this graph? Are there tetrahedral subgraphs corr…
Eigenvalue bounds of the Kirchhoff Laplacian Open
We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a non-decr…
The Tree-Forest Ratio Open
The number of rooted spanning forests divided by the number of spanning rooted trees in a graph G with Kirchhoff matrix K is the spectral quantity tau(G)= det(1+K)/det(K) of G by the matrix tree and matrix forest theorems. We prove that th…
Analytic torsion for graphs Open
Analytic torsion is a functional on graphs which only needs linear algebra to be defined. In the continuum it corresponds to the Ray-Singer analytic torsion. We have formulas for analytic torsion if the graph is contractible or if it is a …
Shannon capacity, Chess, DNA and Umbrellas Open
A vexing open problem in information theory is to find the Shannon capacity of odd cyclic graphs larger than the pentagon and especially for the heptagon. Lower bounds for the capacity are obtained by solving King chess puzzles. Upper boun…
The Curvature of Graph Products Open
We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.
Coloring Discrete Manifolds Open
Discrete d-manifolds are classes of finite simple graphs which can triangulate classical manifolds but which are defined entirely within graph theory. We show that the chromatic number X(G) of a discrete d-manifold G is sandwiched between …
Remarks about the Arithmetic of Graphs Open
The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…
Graph complements of circular graphs Open
Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta functi…
Complexes, Graphs, Homotopy, Products and Shannon Capacity Open
A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both functo…