Related papers: On the Complexity of Bicycle Unitracks

A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We identify 29 graphs that are the minor-obstructions of the…

We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…

In this paper we prove that the space of flat metrics (nonpositively curved Euclidean cone metrics) on a closed, oriented surface is marked length spectrally rigid. In other words, two flat metrics assigning the same lengths to all closed…

Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…

Let $f$ be a function that is analytic in the unit disc. We give new estimates, and new proofs of existing estimates, of the Euclidean length of the image under $f$ of a radial segment in the unit disc. Our methods are based on the…

A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…

We survey the distributional properties of progressively dilating sets under projection by covering maps, focusing on manifolds of constant sectional curvature. In the Euclidean case, we review previously known results and formulate some…

Creases are purposely introduced to thin structures for designing deployable origami, artistic geometries, and functional structures with tunable nonlinear mechanics. Modeling the mechanics of creased structures is challenging because…

A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the…

We investigate the origins of the widely-observed "en passant" crack pattern which forms through interactions between two approaching cracks. A rectangular elastic plate is notched on each long side and then subjected to quasistatic…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

As a healthy and green transportation mode, cycling has been advocated by many governments. However, compared with vast amounts of works on vehicle flow and pedestrian flow, the bicycle flow study currently lags far behind. We have carried…

A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter…

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…

We construct entire curves in projective spaces that exhibit frequent hypercyclicity under translations along countably many prescribed directions while maintaining optimal slow growth rates. Furthermore, we establish a fundamental…

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

The cycle space of a graph corresponds to the kernel of an incidence matrix. We investigate an analogous subspace for digraphs. In the case of digraphs of graphs, where every edge is replaced by two oppositely directed arcs, we give a…

A directed acyclic graph G = (V, E) is pseudo-transitive with respect to a given subset of edges E1, if for any edge ab in E1 and any edge bc in E, we have ac in E. We give algorithms for computing longest chains and demonstrate geometric…

This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…