Related papers: A counterexample to Thiagarajan's conjecture on re…
Jordan algebras arise naturally in (quantum) information geometry, and we want to understand their role and their structure within that framework. Inspired by Kirillov's discussion of the symplectic structure on coadjoint orbits, we provide…
Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
Let $\alpha$ be a contact form on $S^3$, let $\xi$ be its Reeb vector-field and let $v$ be a non-singular vector-field in $ker\alpha$. Let $C_\beta$ be the space of curves $x$ on $S^3$ such $\dot x=a\xi+bv, \dot a=0, a \gneq 0$. Let $L^+$,…
We consider circle packings and, more generally, Delaunay circle patterns - arrangements of circles arising from a Delaunay decomposition of a finite set of points - on surfaces equipped with a complex projective structure. Motivated by a…
A bar-joint framework $(G,p)$ is the combination of a graph $G$ and a map $p$ assigning positions, in some space, to the vertices of $G$. The framework is rigid if every edge-length-preserving continuous motion of the vertices arises from…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
We investigate the topological regularity and stability of noncollapsed Ricci limit spaces $(M_i^n,g_i,p_i)\to (X^n,d)$. We confirm a conjecture proposed by Colding and Naber in dimension $n=4$, showing that the cross-sections of tangent…
Given a normal surface singularity (X,0), its link, M is a closed differentiable three dimensional manifold which carries much analytic information. It is an interesting question to ask whether, under suitable analytic and topological…
It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
The Newlander-Nirenberg theorem says that a formally integrable complex structure is locally equivalent to the standard complex structure in the complex Euclidean space. In this paper, we consider two natural generalizations of the…
Conformance checking techniques aim to provide diagnostics on the conformity between process models and event data. Conventional methods, such as trace alignments, assume strict total ordering of events, leading to inaccuracies when…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…
Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri nets can be used to model concurrent systems and find and…
Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…
It is a well-known and easily established fact that every Euclidean domain is also a principal ideal domain. However, the converse statement is not true, and this is usually shown by exhibiting as a counterexample the ring of algebraic…
Algebraic domains are regions in the plane surrounded by mutually disjoint non-singular real algebraic curves. Poincar'e-Reeb Graphs of them are graphs they naturally collapse: such graphs are formally formulated by Sorea, for example,…