Related papers: Dushnik-Miller dimension of TD-Delaunay complexes

A two-dimensional simplicial complex is called $d$-{\em regular} if every edge of it is contained in exactly $d$ distinct triangles. It is called $\epsilon$-expanding if its up-down two-dimensional random walk has a normalized maximal…

We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toru\'nczyk. We prove that many different types of geometric graphs have unbounded flip-width. These include interval graphs, permutation graphs,…

We consider the monodromy group of the differential systems for multiloop integrals. We describe a simple heuristic method to obtain the monodromy matrices as functions of space-time dimension $d$. We observe that in a special basis the…

Let $D(G)$ be the distance matrix of a simple connected graph $G$. The Hadamard product $D(G)~\circ~ D(G)$ is called the squared distance matrix of $G$, and is denoted by $\Delta(G)$. A simple connected graph is called a starlike block…

A Delaunay decomposition is a cell decomposition in R^d for which each cell is inscribed in a Euclidean ball which is empty of all other vertices. This article introduces a generalization of the Delaunay decomposition in which the Euclidean…

We develop a real-analytic framework, called perplex analysis, in which the complex, split-complex, and dual numbers arise as members of a single four-parameter family of two-dimensional commutative real algebras. Within this unified…

A new proof of an old theorem of Drinfeld concerning the representability of the moduli problem of special formal $\mathcal{O}_{D}$-modules by Deligne's $p$-adic formal model of Drinfeld's upper half-plane is given for $d=2.$ The display…

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M for simplicial d-manifolds M taking values in the range 0 <=…

We analyze the pattern of fields in d+1 dimensional anti-de Sitter space in terms of those in d dimensional anti-de Sitter space. The procedure, which is neither dimensional reduction nor dimensional compactification, is called dimensional…

A graph $G$ with $d+1$ distinct eigenvalues is called strongly distance-regular if $G$ itself is distance-regular, and its distance-$d$ graph $G_d$ is strongly-regular. In this note we provide a spectral characterization of those…

This thesis gives a complete description of the Grothendieck group and divisor class group for large families of two and three dimensional singularities. The main results presented throughout, and summarised in Theorem 8.1.1, give an…

It is proven here that the diameter of the d-dimensional associahedron is 2d-4 when d is greater than 9. Two maximally distant vertices of this polytope are explicitly described as triangulations of a convex polygon, and their distance is…

In the context of D-dimensional Euclidean gravity, we define the natural generalisation to D-dimensions of the self-dual Yang-Mills equations, as duality conditions on the curvature 2-form of a Riemannian manifold. Solutions to these…

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

We prove that in the moduli space of genus-g metric graphs the locus of graphs with gonality at most d has the classical dimension min{3g-3,2g+2d-5}. This follows from a careful parameter count to establish the upper bound and a…

Let $A$ be an algebra and $\sigma$ an automorphism of $A$. A linear map $d$ of $A$ is called a $\sigma$-derivation of $A$ if $d(xy) = d(x)y + \sigma(x)d(y)$, for all $x, y \in A$. A linear map $D$ is said to be a generalized…

The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…

For stationary, homogeneous Markov processes (viz., L\'{e}vy processes, including Brownian motion) in dimension $d\geq 3$, we establish an exact formula for the average number of $(d-1)$-dimensional facets that can be defined by $d$ points…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…