General relativity plays on a pseudo Riemannian manifold (M,g). The Einstein equations describe how matter defines the space time and the geodesic equations describe how mass moves in space time. It is maybe the most beautiful theories that exist as it describes a relatively complicated frame work as part of …
Gauss-Bonnet tells that integrating curvature K over the geometry G is Euler characteristic X. Curvature K is a quantity attached to points in the geometry and Euler characteristic X is an integer. A consequence of the continuity of the functional getting from K to the integral is continuous, a rigidity …
What is the reason for the structure of the Standard Model? For a mathematician, it better has to be something inevitable. The model is the periodic system of elements is all based on the geometry of the space G one considers. If G has an exterior derivative, one has a …
There are exactly 3 associative real normed division algebras as the Frobenius theorem from 1879 tells. Each of them produce natural Lie groups . Each of them produces natural dense sphere packings . Each of them produces natural rings , the ring of integers, the Eisenstein ring and the ring …
The 2 dimensional plane can be characterized as the only simply-connected two dimensional flat manifold. In the discrete there is a similar uniqueness. The discrete hexagonal plane is the only 2-manifold that is flat and simply connected. Compact flat 2-manifolds like the torus or Klein bottle are not simply connected …
There is a soft Barycentric refinement of graphs or simplicial complexes which can be seen as the usual Barycentric refinement in which the second highest dimensional simplices are collapsed. It is a triangulation of the dual complex. The soft Barycentric refinement of a d-dimensional cross polytop for example is a …
This is just an update on two topics looked over during the summer. In the case of the QR flow and Toda flow equivalence, I have had a hard time finding it due to some strange ways how Mathematica computes the QR composition. You can try yourself: the diagonal entries …
Here is the proof that is solved by with , the QR decomposition. Proof. We show that is solved . From by $Q_t$ with , we get . Look at the differential equations for Q,R with initial condition . The first equation gives the conjugating orthogonal transformation. Then, . But …
Update of November 4th 2024: There is a memorial in honor of Henry McKean at NYU on November 15th 2024. Last week, when looking up Henry McKean, I saw that he passed away on April 20, 2024. I don’t recall having met him in person but I have seen some …
A real symmetric matrix is called a Dirac matrix, if it is a block Jacobi matrix in which the side diagonal entries are nilpotent, meaning . For such a matrix, the square is called the Laplacian. It is block diagonal . If is a continuous function such that is invertible, …
A discrete geometry does not have a lot of symmetry as the automorphism group is in general empty. The isospectral set of the Laplacian or Dirac matrix is large enough however. Note that when dealing with a specific class of operators like Dirac matrices, then not all isospectral matrices qualify. …
Since finding the isospectral deformation of the exterior derivative (see “An integrable evolution equation in geometry” from June 1, 2013 and “Isospectral Deformations of the Dirac operator” from June 24, 2013), I tried to find discrete time integrable evolutions of the Dirac operator. Last Sunday, while experimenting in a coffee …
A 2-manifold with boundary is a finite simple graph for which every unit sphere is a circular graph with 4 or more nodes or a path graph with 3 more nodes. The boundary is the set of vertices for which the unit sphere is a path graph, the interior is …
An abstract delta set (G,D,R) is a finite set G with n elements, a selfadjoint Dirac matrix with and a dimension vector defining a partition and Hilbert spaces called the spaces of k-forms. The exterior derivative maps to . The Hodge Laplacian is a block diagonal matrix defining the Hodge …
This is a presentation from Saturday, July 13, 2024. Curvatures are usually located on the zero dimensional part of space. I look here at curvature located on one or two dimensional parts of space. In the special case of a triangulation of a 2-dimensional surface, where the usual curvature is …
Explanations of the Casimir effect using common physics intuition like “polarization” (it originally was studied in the context of van der Waals forces) or “pressure” do not work. The reason in the case of the Casimir effect is that in the case of two planes or two cylinders the Casimir …
In this presentation, there is a bit of advertisement for finite geometry and delta sets in particular. I also tried to get a bit into the history of finitist ideas in geometry and physics(starting with Riemann). One usually thinks about finite projective spaces when talking about “finite geometries”. I like …
I looked at a quadratic cohomology example. For theoretical backgroun, see the ArXiv paper “Fusion inequality for quadratic cohomology”. It is the case when U is a union of two disjoint smallest open sets in a 2-sphere for which I take the Icosahedron, one of the Platonic solids and a …
While linear cohomology deals with functions on simplices, quadratic cohomology deals with functions on pairs of simplices that intersect. Linear cohomology is to Euler characteristic what quadratic cohomology is to Wu characteristic $w(G) = \sum_{x,y, x \cap y \in G} w(x) w(y)$. If the simplicial complex is split into a …
Delta sets are very general. They include simplicial complexes, open sets in simplicial complexes, quotients of simplicial complexes, quivers and so multi-graphs or simply hypergraphs, sets of sets. For the later, the geometry is not that interesting in general. As for quivers, the associated delta set is one dimensional only …
Quivers are graph in which multiple connections and loops are allowed. Since there is a Dirac operator d+d* with exterior derivative for them, they define a one-dimensional delta set (G,D,r), where G is the union of vertices and edges (loops count as edges) and r is the dimension function which …
If is a finite abstract simplicial complex, a finite set of non-empty sets closed under the operation of taking non-empty subsets, we can ask about what f-vectors can occur if counts the number of sets of cardinality k in G. The case of the complete complex with gives a hint …
The smallest open sets in a finite topological space form the atom of space. It was almost 100 years ago, when one has turned away from non-Hausdorff topological spaces and decided they are less relevant (Hausdorff seems have convinced Alexandrov and Hopf to focus on Hausdorff property). This is unfortunate …
Historically, geometry started in Euclidean spaces. There was no concept of coordinate when Euclid wrote the “elements”. Using “points” and “lines” as building blocks and some axioms, the reader there is lead to quantitative concepts like “length”, “angle” or “area” and many propositions and theorem. Only with Descartes, the concept …
Here are three catchy open problems in differential geometry. As with any problem, we can look how to formulate discrete versions. The first problem is whether a positive curvature 2d manifold has positive Euler characteristic, the second is whether there is a positive curvature metric on and the third is …
Finite geometric categories: graphs – simplicial complexes -simplicial sets – delta sets Delta sets were originally called semi-simplicial sets by Samuel Eilenberg and Joseph Zilber in 1950. Similarly than semi-rings are more general than rings or semi-groups are more general than groups, also delta sets are more general than simplicial …
The discrete Sard theorem in the simplest case (which I obtained in 2015) that a function from a discrete d-manifold to {-1,1} has level sets that are (d-1) manifolds or empty. (See here for the latest higher generalization to higher codimension.) A simplicial complex is a d-manifold if every unit …
Here are some links to the articles mentioned in the talk: It surprisingly often happens that a big conjecture tumbles at around the same time. In the case of the Arnold conjecture, several approaches, spear headed by Conley-Zehnder, Eliashberg and Floer have reached the goal. But also almost always with …
The last geometric theorem of Poincare was conceived shortly before the death of Poincare. Poincare had a prostate problem when he was 58 and went to surgery in 1912 which he did not survive. Fortunately his last theorem was sent to an Italian journal two weeks before he died, but …
Finite topological spaces are only interesting if non-Hausdorff. The reason is that every Hausdorff finite topological space is just the boring discrete topology. The topology from a simplicial complex is an example of a nice and interesting topology because it produces the right connectivity and dimension on the complex without …
It is not quite yet a poem, but here, as promised in the movie, some code to generate both the Betti vector and Wu betti vector of a random submanifold in a given manifold. It is 25 lines without any additional libraries, so not yet quite a poem, but it …
My experiments so far indicate that the Wu cohomology of a d-manifold G can be read off from the usual cohomology. If is the Betti vector of G then (0,\dots,0,b_d,b_{d-1},\dots,b_1,b_0)$ appears to be the Wu Betti vector. So far, this is only a conjecture. In the talk, the case , …
[Update 3/5/2024: given that one knows now the optimal Moebius strip, one can wonder about the much easier question of what the smallest simplicial complex producing a cylinder or Moebius strip is. Below, I use in both cases 6 facets (triangles). For the Moebius strip, one can do with 5 …
The video below is an attempt to get back to an older story of Wu characteristic. One of the things which still needs to be explored badly is the Wu cohomology of the complement K of knots H and more generally of the complement K of k-dimensional manifolds H in …
If G is a d-manifold and is an arbitrary map, the discrete Sard theorem tells that is an open set in G that is a (d-k)-manifold. We mean with that the graph encoding the incidence of the sets in H is a (d-k) manifold. The sub-manifold H of K is …
Here is some code illustrating the story. We take the 4 manifold (a favorite manifold of Heinz Hopf) and consider two random functions f,g. Now generate the two manifolds and . They are both 2 manifolds. It goes as follows: the sign data of {f,g} are in which are 4 …
Coordinates are function values. On the two functions and , allow to determine every point in the plane. In the continuum coordinates are commutative: is the same than . This commutativity also holds in Riemannmian manifold settings. In the discrete this is no more true. Lets for simplicity assume we …
The updated document “manifolds from partitions” with more code. I then mention the index theorem for simple graphs dealing with the symmetric index . Writing the unit sphere as a union of and and $M_f(v)$, the center manifold. Now . In the interpretation with the joined center manifold , the …
Again a little bit of a flashback to my earliest steps in doing mathematical research. The Pentagonal number theorem is one of the most beautiful theorems in number theory. It uses the Pentagonal numbers to get a recursion for the partition function . This can be written as ( typo …
In my paper “Manifolds from Partitions”, I stated that that the case of empty graphs can not occur, but did not prove it. It is indeed not true. Here is an update [PDF] with an additional section. It is very rare although that a surjective map produces still an empty …
My experience from my Schweizer Jugend Forscht adventure was not only invaluable from the scientific point of view, I also met some other young aspiring scientists (here is the book with all the participants (PDF)) which was published in 1983 (when I was already a second year ETH student), and …
A nice thing about mathematics is that it has no dogmas, statements which have to be taken on good faith. Axioms come closest, but by nature also, they come with an honest warning that one can either accept them or not. Already Euclid fought with the parallel axiom. Today it …
Brevity contributes both to clarity and simplicity. Surprisingly, it often contributes to generality. I myself am obsessed with brevity. I especially love short code. A short program is like a poem. If it is also effective, it can also be used as building blocks of larger programs. The Unix philosophy …
Eugene Wigner in 1939 associated elementary particles with irreducible representations of groups, especially the Poincare group. In a first year algebra course, we learn about representations of finite groups and especially the symmetric group , where there are p(n) irreducible representations, where p(n) is the number of integer partitions of …
Happy new year 2024. Here is the code displayed on the right upper corner of the board written this morning when wondering how frequent the situation is that the year is divisible by the year modulo 1000 minus 1. This happens for 2024 as it is divisible by 23. The …
First about Sard: (a write-up [PDF] ). I also display a bit my hobbies: Panorama photography (since 1999, a time when panoramas were still stichted). Later with a mirror camera. Then with GoPro Max, Iphone and more recently with the insta 360 camera (I for strange tech enhousiastic reasons pride …
In the program to get rid of any notion of infinity, one necessarily has to demonstrate that very classical and entrenched notions like topics appearing in a contemporary multi-variable calculus course can be replaced and used. Artificial discretisations do not help much in that; they serve as numerical schemes but …
There are lots of finite geometric structures. Graphs are probably the most clear ones. Simplicial complexes can not be beaten in simplicity. And delta sets can not be surpassed by generality. So, they are a geometric incarnation of the paradigm “Simplicity, Clarity and Generality”, which appeared on the book cover …
Here is the table shown in part 2 of the presentation showing some of the toys. It had been generated by Mathematica. It uses manifolds from the manifold page of Frank H. Lutz mentioned in the clip. About the left hand side (of the chalkboard) with some history pointers of …
One of the nice things in mathematics is that one can play with models which do not necessarily have to do directly with the real world, whatever the later means. We can look at abstract objects, like finite simple groups, number theory in some number field or topology in 1001 …
What is {f=0,g=0} for two functions f,g on a graph G. If G is a 4-manifold, these are 2-manifolds or empty.
We look at four different features or properties which can be invoked when looking at a mathematical problem. Why is something beautiful, when is it difficult, how hard is it or are there any surprises?
Arboricity and Chromatic number are linked in various ways. The topic also links to difficult NP complete problems. We muse about how often it is the case that for manifolds the question is easy. An example is the Hamiltonian path problem which is linked to Peg Solitaire
One of the nice things to work in a subject not having grown up in is to be in steep learning curves. I have thought about the arboricity of manifolds for a while now but the fact that the arboricity can be arbitrary large for d-manifolds with d larger than …
We aim to write down a short proof of the statement that a planar graph has arboricity 3 or less.
The Acyclic Chromatic Number is bounded above by the arboricity. We can improve this by one if the Acyclic Chromatic number is even.
We explain why the arboricity of 3 spheres can take values between 4 and 7 and mention that for 3 manifolds the upper bound is 9 (but believed to be 7).
We look at the problem to find the possible arboricities which a 3-sphere can have.
We work on the result that any 2-sphere can be covered by 3 trees.
In other words: three trees suffice.
The three tree theorem tells that any discrete 2-sphere has arboricity exctly 3.
We aim to show that the Lusternik-Schnirelmann category of a graph is bound by the augmented dimension. We can try to prove this by using tree coverings and so look at arboricity.
A notion of a discrete vector should work for theorems like Poincare-Hopf and also produce a dynamics as classically, a vector field F, a smooth section of the tangent bundle on a manifold produces a dynamics . A directed graph does not give a dynamics without telling how to go …
In 1973 Leon Glass proved a discrete Poincare Hopf theorem for directed graphs embedded in a 2 dimensional manifold. Kate Perkins has related this to a discrete Poincare Hopf theorem of mine. This is a discussion of the connection.
This is a bit of a continuation from a previous video about Lusternik-Schnirelmann and Morse. I would like to have this chapter as elegant as possible. As for the video, there is a bit of overlap with a previous video on this from the fall, when I circled back to …
We discuss briefly how to make the cohomology space of a graph into a cohomology ring. In other words, how to define the cup product on the kernel of the Hodge Laplacian.
About the cohomology of measurable sets in a probability space equipped with an automorphism.
The pendulum equation can be solved explicitly using the Weierstrass elliptic function.
Something about knots and something about topological data analysis and something about the general frame work to do mathematics in a finite setting.
A bit the bigger picture about the mathematical and data structures which come in when working on these finite geometries.
A youtube presentation of May 13, 2023. We point out that we have a relatively simple approach to Eilenberg-Steenrod.
It is a simple but interesting fact that if we look at a wave equation with discrete space, we also need discrete time provided we want causality, a property which every wave equation should have. The reason is that the solution equation in a causal locally finite geometry is an …
About the proof of the fusion inequality and the problem of finding the case where the
Dynamical systems on geometric spaces are very common in mathematics. Mean curvature flows, Ricci flows etc. We can think of a subcomplex K in a simplicial complex G as a geometric object. We can not break randomly elements away as would in general lose the property of having a subcomplex. …
We write a bit more about four papers which are relevant for the Fusion inequality on the Betti numbers of an open and closed pair in a simplicial complex.
We prove that the spectrum of the Hodge Laplacian dd* +d*d depends in a monotone way on the simplicial complex.
An update about the scattering problem when an open and closed set merge. During the process the harmonic forms on K and U merge to harmonic forms on G. The open problem is to prove that no new harmonic forms can appear. This is the content of the fusion inequality. b(U) + b(K) – b(G) being non-negative.
Over the weekend, I gave a glimpse on some code which allows to compute the cohomology of an open or closed set in a simplicial complex. Here are 5 lines for cohomology. We see how elegant this can all be. Simplicity, Clarity and Generality. This code could in principle compute …
Over the winter break I started to look at Mayer-Vietoris type rules when looking at cohomology of subsets of a simplicial complex. See January 28, 2023 (Youtube) , and February 4th 2023 (Youtube) and most recently on February 19, 2023 (Youtube). Classically, cohomology is considered for simplicial complexes and especially …
A finite abstraact simplicial complex or a finite simple graph comes with a natural finite topological space. Some quantities like the Euler characteristic or the higher Wu characteristics are all topological invariants. One can also reformulate the Lefschetz fixed point theorem for continuous maps on finite topological spaces.
The Arnold conjecture in symplectic geometry has been tackled with two different approaches. One of them is Morse theory, an other one is Lusternik-Schnirelmann theory.
Even or odd, symmetric or anti-symmetric, integer or half integer, measures or de Rham currents, densities or differential forms, undirected or directed, orientation oblivious, or orientation sensitive, primes of the form 4k+1 or primes of the form 4k-1, permanents or determinants: there are many notions of mathematics which can be …
There were two updates on the Cauchy central limit theorem telling that if the Cauchy mean and risk of a random variable X with PDF f is finite and non-zero, then any IID random process with that distribution has normalized sums which converge in distribution to the Cauchy distribution. There …
There were two triggers for this: first of all the KAM fixed point equation is for c=0 a renormalization map which matters in probability theory, in particular for the Cauchy distribution which is a fixed point under the map which gets from a distribution the distribution of [X+Y]/2, where X,Y …
There are various versions of the implicit function theorem. We look first at the soft implicit function theorem, then a theorem of John Neuberger, then at the twist map theorem which uses a hard implicit function theorem.
Barycentric and Connection graphs Barycentric graphs depend on incidence, connection graphs on intersection. Here are some examples from this blog. Both graphs have as the vertex set the complete subgraphs of the graph. In the connection graph, we take the intersection, in the Barycentric case, we take incidence. Here are …
All data are finite. A computer can only represent finitely many real numbers in an interval. We can connect two such numbers if they are considered equal by the computer. This produces a graph,l the machine graph. It is a special Vietoris-Rips graph. The story can also illustrate non-standard notions.
Leonhard Euler wrote in 1767 a “complete guide to algebra”. It might appear strange that one of the most productive and innovative mathematicians of all time would “waste” his time with writing a textbook for school children. But Euler knew how important algebra is. Not only for school but also …
In the new Netflix documentary “a trip to infinity” the question of quantum space comes up. It is interesting to see Brian Green (the famous TV star covering about quantum gravity, big bang, fabric of the cosmos elegant universe or string theory) now seems have been converted to the “finite …
A bit more about Mandelbulb, Mandelbrot, Hopfbrot and discrete Mandelstuff. Some slides [PDF]. To be pure to the discrete, we also have a short part on Mandelbrot sets in finite rings … Update September 15, 2022: Mandelbulbs in Mathematica in 3 lines. I worked this morning to get this down …
The White-Nylander Mandelbulb is one of the most beautiful objects in mathematics. It extends the Mandelbrot set since one slice is the Mandelbrot set.
We look at two inverse problems in mathematics. The first asks to reconstruct a function from its level curves. The second asks to reconstruct a graph from the quiver spectra.
The current trend in mathematics is to become more and more abstract and strange. We go here the opposite way and look at Riemann-Roch in the simplest possible case, when space is a point!
The video of August 20 also gave a bit of an overview of graph products. I should have mentioned the Lexicographic product (introduced by Hausdorff in 1914) mentioned in my article on Graphs, Groups and Geometry. Here is an abbreviation of the story of that video: for finite simple graphs, …
A new video recorded on August 13, 2022. We look at how Delta sets can be used to define a natural Euler characteristic for quivers. Delta sets have been introduced in 1950 by Samuel Eilenberg and Joseph Zilber. Delta sets are for me much more intuitive than simplicial sets. Look …
About the problem of defining an Euler characteristic for a multi-graph or quiver. While for finite simple graphs we have a natural associated finite abstract simplicial complex, we need for multi-graphs a more general structure. Delta sets do the job and allow to define a good Euler characteristic.
The paper [PDF] on the upper bound is updated a bit. It will also be updated on the ArXiv. In the video below, there is an update. Both for quivers as well as non-magnetic quivers (quivers without multiple connections), we can use induction to prove results. One of the amendments …
Quivers allow to model Schroedinger operators on graphs. With loops we can modify scalar values on vertices, with multiple connections, we can modify the magnetic part. This makes quivers attractive as well as theorems about quivers more interesting. An example was . In the talk last Saturday, I also mentioned …
Quiver Terminology Quivers are finite graphs (V,E) in which also multiple connections or loops are allowed. V is a finite set and E is just a finite set of pairs (a,b) with a,b in V. Now (a,a) loops are allowed as are multiple occurrences of the same entry (a,b). The …
In my theorem telling that the k-th largest eigenvalue for the Kirchhoff Laplacian of a finite simple graph satisfies the bound I use a lemma which generalizes the Andrson-Morley super symmetry result of 1985. That paper had provided a ground breaking upper bound for the spectral radius . The proof …
The definition of soft manifoldss now fixed. It is only fitting to call the old discrete manifolds hard manifolds. Unlike the later, soft manifolds can be multipied. They define a subring of the Shannon ring.
What is space? In Spring 2021, prompted by work on graph complements of circular graphs, I started to think more about discrete manifolds. One can see the definition on this video on discrete homotopy manifolds. In the spring of 2022, the definition got slightly modified and the name homotopy manifold …
An update on tree and forest indices which measure the exponential growth rate of the number of spanning trees or forests when doing Barycentric refinement. This needs an upper bound estimate of the eigenvalues of the Kirchhoff Laplacian.
The tree forest ratio of a finite simple graph is the number of rooted spanning forests divided by the number of rooted spanning trees. By the Kirchhoff matrix tree theorem and the Chebotarev-Shamis matrix forest theorem this is where Det is the pseudo determinant and K the Kirchhoff matrix the …
The maze theorem tells that the number of spanning trees in a 2-sphere is equal to the number of spanning trees in the dual graph.
We report on some progress on analytic torsion A(G) for graphs. A(G) is a positive rational number attached to a network. We can compute it for contractible graphs or spheres.
We comment on analytic torsion for graphs. We prove here a conjecture voiced in the video (discovered experimentally in 2015) that the analytic torsion of a 2-dimensional sphere is |V|/|F|.
This still belongs to the framework of natural groups. The Lamplighter group as a wreath product or semi-direct product is a prototype group which illustrates some mathematics. First of all, the group, like the integers, is not a natural group. Given a metric structure invariant under the group, one can …
This is a bit of an update on the problem to find the limiting law in the Barycentric central limit theorem. (See some older slides.) The distribution has first experimentally been found in the PeKeNePaPeTe paper in 2012. I proved universality in 2015 using a modification of the Lidski theorem …
About three interesting groups: Nichols-Rubik cube, Grigorchuk group, Gupta-Sidki group.
We continue to look at natural groups.
There is some progress in seeing that the Rubik cube group is natural: semi direct products can be represented by zig-zag products of Cayley graphs.
A bit about group theory triggered by the observation that some of the non-natural groups are non-simple groups which do not split. The later problem is a central issue in the classification problem of finite groups. While the finite simple groups have been classified in a monster effort and finitalized …
A bit more update on the project of natural spaces. Which groups are natural, which metric spaces are natural, which graphs are natural?
A discrete ultra-finite Taylor theorem is a perfect expansion producing exact numbers (data fitting) with the property that evaluating the value of the sum at every point is a finite sum.
An update about natural spaces, something about time and the irreversibility riddle, a dihedral time postulate and something about natural graphs.
Is the dyadic group of integers natural in the sense that there is a metric space which forces the group structure on it?
A natural metric space defines a unique group structure on the same set such that all group operations are isometries. The integers are not natural but the dihedral numbers are. The half integers are in this sense more natural than the integers.
These days, I look a bit at an elementary problem. Deform the algebra of polynomials and derivatives so that all Taylor series are finite sums when evaluated at some point. This is a task which an ultra finitist is interested in. Ultra finitism is a branch of mathematics in which …
The discrete Cauchy integral theorem can be formulated in the discrete so that it looks like in the continuum.
Two videos about discrete symplectic geometry and discrete complex analysis.
The Curvature of graphs multplies under the Shannon product (strong product).
A few more remarks [PDF] about graph arithmetic. Now on the ArXiv. (Previous documents are here (June 2017 ArXiv), here (August 2017 ArXiv) and here (May 2019 ArXiv). The talk below on youtube was used for me to get organized a bit. It does not look like much has changed, …
Last summer I have had some fun with codimension 2 manifolds M in a purely differential geometric setting: a positive curvature d-manifold which admits a circular action of isometries has a fixed point set K which consists of even codimension positive curvature manifold. The Grove-Searle situation https://arxiv.org/abs/2006.11973 is when K …
It is now 7 years, since I started to think about coloring discrete manifolds, graphs for which unit spheres are (d-1)-spheres, where d-spheres are d-manifolds which after a removal of a vertex become contractible. The problem has not gained any attention which is a good thing because there are many …
Last week, I practiced a bit more enhanced talk presentation style in which, rather than with slides, the content is spoken and then enhanced in the video using additonal illustrations. The presentation deals with some things I have done in graph theory which I consider as part of quantum calculus …
10 theorems about discrete manifolds were featured in a youtube video.
The problem of discretization It is a question which probably was pondered first by philosophers like Democrit or Archimedes. What is the nature of space? It is made of discrete stuff or is it a true continuum? As Plato already noted, such questions border to being pointless as we live …
One dimension I have always also fun teaching single variable calculus. This year, the course site is here. One of the great pioneers in real analysis was Bernard Bolzano. He was not recognized enough during his life but he was one of the first to realize that theorems about continuous …
Graph complements of cylic graphs are homotopic to spheres or wedge sums of spheres. Their unit spheres are graph complements of path graphs and have Gauss-Bonnet curvature which converges to a limit.
Summary of update of current work Since a few weeks I work more on the arithmetic of graphs and especially the strong ring of simplicial complexes which can be extended to a unital commutative Banach algebra. This line of research had started late 2016, while preparing for a workshop on …
The results mentioned in the slides before are now written down. This document contains a proof of the energy relation . There are several reason for setting things up more generally and there is also some mentioning in the article: allowing general rings and not just division algebras extends the …
The energy theorem for Euler characteristic X= sum h(x)was to express it as sum g(x,y)of Green function entries. We extend this to Wu characteristic w(G)= sum h(x) h(y) over intersecting sets. The new formula is w(G)=sum w(x) w(y) g(x,y)2, where w(x) =1 for even dimesnional x and w(x)=-1 for odd dimensional x.
As Hardy once pointed out in his apology, “languages die but mathematical ideas do not”. Hardy added that a mathematician “]has the best chance of becoming immortal whatever the word immortal might mean”. Let me illustrate this with three mathematicians, all teachers of mine, who have earned more than immortality. …
We look at random circle valued fields on a simplicial complex and the spectra of the corresponding connection laplacian.
The energy theorem for simplicial complexes equipped with a complex energy comes with some surpises.
Abstract for this post Analysis had not been my favorite topic at first. The subject appeared to me quite technical and tedious even when sweetened like in analytic number theory. The Sine-Gordon topic and other rather concrete topics in dynamical systems theory changed that a bit and I ended up …
Being in the process of wrapping up the latest summer calculus course, here are some thoughts about the frame work of calculus and more generally of classical field theories. It is an old theme for me which I think about often while teaching calculus. The question how to make calculus …
A major open problem in Riemannian geometry is the classification of even dimensional positive curvature manifolds with symmetry. There is a reduction theory which produces a periodic system of elements. This picture has affinity with gauge bosons in physics.
Introduction The idea to base physics on the evolution finite set of sets is intriguing. It has been tried as an approach to quantum gravity. Examples are causal dynamical triangulation models or spin networks. It is necessary to bring in some time evolution as otherwise, a model has little chance …
The Hopf conjectures were first formulated by Hopf in print in 1931. The sign conjecture claims that positive curvature compact Riemannian 2d-manifolds have positive Euler characteristic and that negative curvature compact Riemannian 2d-manifolds have Euler characteristic with sign (-1)d . The product conjecture claims there is no positive curvature metric …
The question In discrete Poincare-Hopf for graphs the question appeared how to generalize the result from gradient fields to directed graphs. The paper mentions already the problem what to do in the case of the triangle with circular orientation. The triangle has Euler characteristic 1. An integer index on vertices …
The Mickey mouse theorem assures that a connected positive curvature graph of positive dimension is a sphere.
Finite sets of sets can be seen as a combintarorial oddity. There is a lot of mathematical structure available on such simple finitist constructs.
If a set of set is equipped with an energy function, one can define integer matrices for which the determinant, the eigenvalue signs are known. For constant energy the matrix is conjugated to its inverse and defines two isospectral multi-graphs.
The counting matrix of a simplicial complex has determinant 1 and is isospectral to its inverse. The sum of the matrix entries of the inverse is the number of elements in the complex.
The parametrized poincare-hopf theorem allows to see the f-vector of a graph in terms of the f-vector s of parts of the unit spheres of the graph.
Dehn-Sommerville spaces are generalized spheres as they share many properties of spheres: Euler characteristic and more generally Dehn-Sommerville symmetries.
We have calculated with graphs from the very beginning: Humans computed with pebbles like in this scene of the `Clan of the Cave Baer` (1986)) or with line graphs when writing with tally sticks (see this lecture). In all of these cases, the addition of graphs is the disjoint union …
The f-function of a graph minus 1 is the sum of the antiderivatives of the f-function anti-derivatives evaluated on the unit spheres.
Dehn-Sommerville relations are a symmetry for a class of geometries which are of Euclidean nature.
Branko Grünbaum (1929-2018) passed away last September. Here is the obituary from the university of Washington. One of his master pieces is the book “Tilings and patterns”, written with G.C. Shephard. The well illustrated book is considered the bible on Tilings. Here is a page from that book: Links: Personal …
Some update about recent activities: a new calculus course, the Cartan magic formula and some programming about the coloring algorithm.
We prove that any discrete surface has an Eulerian edge refinement. For a 2-disk, an Eulerian edge refinement is possible if and only if the boundary length is divisible by 3
We prove that connected combinatorial manifolds of positive dimension define finite simple graphs which are Hamiltonian.
A simplicial complex G defines the connection matrix L which is L(x,y)=1 if and only if x and y intersect. The dual matrix is K(x,y)=1 if and only if x and y do not intersect. It is the adjacency matrix of the dual connection graph.
The beautiful Alexander duality theorem for finite abstract simplicial complexes.
We compute the quadratic interaction cohomology in the simplest case.
The interaction cohomology of the dunce hat is computed. We then comment on the discrete Lusternik-Schnirelmann theorem.
This is an other blog entry about interaction cohomology [PDF], (now on the ArXiv), a draft which just got finished over spring break. The paper had been started more than 2 years ago and got delayed when the unimodularity of the connection Laplacian took over. There was an announcement [PDF] …
For a one-dimensional simplicial complex, the sign less Hodge operator can be written as L-g, where g is the inverse of L. This leads to a Laplace equation shows solutions are given by a two-sided random walk.
Here is the code to compute a basis of the cohomology groups of an arbitrary simplicial complex. It takes 6 lines in mathematica without any outside libraries. The input is a simplicial complex, the out put is the basis for $H^0,H^1,H^2 etc$. The length of the code compares in complexity …
We found a formula of the green function entries g(x,y). Where g is the inverse of the connection matrix of a finite abstract simplicial complex. The formula involves the Euler characteristic of the intersection of the stars of the simplices x and y, hence the name.
When replacing the circle group with the dyadic group of integers, the Riemann zeta function becomes an explicit entire function for which all roots are on the imaginary axes. This is the Dyadic Riemann Hypothesis.
The Wu characteristic of a simplicial complex is the eigenvalue of an
eigenvector to a matrix L J, where L is the connection Laplacian and J
a checkerboard matrix. The eigenvector has components whicih are
Wu intersection numbers.
The classical potential $V(x,y) = 1/|x-y|$ has infinite range which violently clashes with relativity. Solving this problem had required a completely new theory: GR. It remains also a fundamental problem still in general relativity: a Gedanken experiment in which the particles in the sun suddenly transition to particles without mass …
A simplicial complex G, a finite set of non-empty sets closed under the operation of taking finite non-empty subsets, has the Laplacian . It is natural, as it is always unimodular so that its inverse matrix is always integer valued. In a potential theoretical setup, the Green function values measure …
We have seen that for a finite abstract simplicial complex $G$, the connection Laplacian L has an inverse g with integer entries and that $g(x,x) = 1-X(S(x))$, where $S(x)$ is the unit sphere of $x$ in the graph $G_1=(V,E)$, where $V=G$ and where (a,b) in E if and only if …
One can not hear a complex! After some hope that some kind of algebraic miracle allows to recover the complex from the spectrum (for example by looking for the minimal polynomial which an eigenvalue has and expecting that the factorization reflects some order structure in the abstract simplicial complex), I …
According to Wikipedia, the mathematician Wen-Tsun Wu passed away earlier this year. I encountered some mathematics developed by Wu when working on Wu characteristic. See the Slides and the paper on multi-linear valuations. There is an other paper on this in preparation, especially dealing with the cohomology belonging to Wu …
A finite abstract simplicial complex has a natural connection Laplacian which is unimodular. The energy of the complex is the sum of the Green function entries. We see that the energy is also the number of positive eigenvalues minus the number of negative eigenvalues. One can therefore hear the Euler characteristic. Does the spectrum determine the complex?
One of the attempts to quantize space without losing too much symmetry is ergodic theory. Much of my thesis belongs to this program. It is a flavor of quantum calculus, as “no limits” are involved. The story is closely related to Jacob Feldman, one of my heroes of my graduate …
In the context of quantum calculus one is interested in discrete structures like graphs or finite abstract simplicial complexes studied primarily in combinatorics or combinatorial topology. Are they geometry? Are they calculus? What is geometry? In MathE320 I try to use the following definition: Geometry is the science of shape, …
The mathematics of evolving fields with two complex components is known already in Jones calculus.
This blog entry delivers an other example of an elliptic complex which can be used in discrete Atiyah-Singer or Atiyah-Bott type setups as examples. We had seen that when deforming an elliptic complex with an integrable Lax deformation, we get complex elliptic complexes. We had wondered in that blog entry …
As a follow-up note to the strong ring note, I tried between summer and fall semester to formulate a discrete Atiyah-Singer and Atiyah-Bott result for simplicial complexes. The classical theorems from the sixties are heavy, as they involve virtually every field of mathematics. By searching for analogues in the discrete, …
The strong ring is a category of geometric objects G which are disjoint unions of products of
simplicial complexes. Each has a Dirac operator D and a connection operator L. Both are related in
various ways to topology.
Implementing the Dirac operator D for products of simplicial complexes without going to the Barycentric refined simplicial complex has numerical advantages. If G is a finite abstract simplicial complex with n elements and H is a finite abstract simplicial complex with m elements, then is a strong ring element with …
In the book ‘This Idea Must Die: Scientific Theories That Are Blocking Progress’, there are two entries which caught my eye because they both belong to interests of mine: geometry and calculus. The two articles are provided below. [I believe it is “fair use” as a reprint of these two …
The strong ring The strong ring generated by simplicial complexes produces a category of geometric objects which carries a ring structure. Each element in the strong ring is a “geometric space” carrying cohomology (simplicial, and more general interaction cohomologies) and has nice spectral properties (like McKean Singer) and a “counting …
Elements in the strong ring within the Stanley-Reisner ring still can be seen as geometric objects for which mathematical theorems known in topology hold. But there is also arithemetic. We remark that the multiplicative primes in the ring are the simplicial complexes. The Sabidussi theorem imlies that additive primes (particles) have a unique prime factorization (into elementary particles).
The graph limit We can prove now that the graph limit of the connection graph of Ln x Ln which is the strong product of Ln‘ with itself has a mass gap in the limit n to infinity. The picture below shows this product graph for n=13, and to the …
Arithmetic with networks The paper “On the arithmetic of graphs” is posted. (An updated PDF). The paper is far from polished, the document already started to become more convoluted as more and more results were coming in. There had been some disappointment early June when realizing that the Zykov multiplication …
Depending on scale, there are three different Kepler problems: the Hydrogen atom, the Newtonian Kepler problem as well as the binary Blackhole problem. The question whether there is a unifying model which covers all of them is part of the quest of finding a quantum theory of gravity.
