相关论文: Doubling chains on complements of algebraic hypers…

It is known that any $n$-point set in the $d$-dimensional Euclidean space $\mathbb{R}^d$, for $d = O(1)$, admits: 1) a $(1+\epsilon)$-spanner with maximum degree $\tilde{O}(\epsilon^{-d+1})$ and with lightness $\tilde{O}(\epsilon^{-d})$; 2)…

Globally coupled doubling maps are studied in this paper. In this setting and for finitely many sites, two distinct bifurcation values of the coupling strength have been identified in the literature, corresponding to the emergence of…

In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any $n$-point doubling metric, any $\eps > 0$, and any integer $0 \le k \le n-2$, our construction provides a…

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…

We construct D=11 supergravity solutions dual to the twisted field theories arising when M-theory fivebranes wrap supersymmetric cycles. The cases considered are M-fivebranes wrapped on (i) a complex Lagrangian four-cycle in a D=8…

In the homomorphism order of digraphs, a duality pair is an ordered pair of digraphs $(G,H)$ such that for any digraph, $D$, $G\to D$ if and only if $D\not\to H$. The directed path on $k+1$ vertices together with the transitive tournament…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

We interpret a normal surface in a (singular) three-manifold in terms of the homology of a chain complex. This allows us to study the relation between normal surfaces and their quadrilateral co-ordinates. Specifically, we give a proof of an…

From the worldsheet perspective, the superpotential on a D-brane wrapping internal cycles of a Calabi-Yau manifold is given as a generating functional for disk correlation functions. On the other hand, from the geometric point of view,…

Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…

Suppose $C$ is a compact, $n$-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an…

Given a compact pseudo-metric space, we associate to it upper and lower dimensions, depending only on the metric. Then we construct a doubling metric for which the measure of a dillated ball is closely related to these dimensions.

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \lfloor…

The unitary Cayley graph $C_R$ of a finite unital ring $R$ is the simple graph with vertex set $R$ in which two elements $x$ and $y$ are connected by an edge if and only if $x-y$ is a unit of $R$. We characterize the unitary Cayley graph…

In this work we review a systematic, algorithmic construction of dual heterotic/F-theory geometries corresponding to 4-dimensional, N = 1 supersymmetric compactifications. We look in detail at a class of well-defined Calabi-Yau fourfolds…

A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

The appearance of infinitely-many period-doubling cascades is one of the most prominent features observed in the study of maps depending on a parameter. They are associated with chaotic behavior, since bifurcation diagrams of a map with a…