Related papers: On the Circuit Diameter Conjecture for Counterexam…

We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed…

Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…

This paper presents a topological framework for investigating the Birch and Swinnerton Dyer conjecture through four dimensional embeddings of elliptic curves. We propose a correspondence between the algebraic rank of an elliptic curve and…

It is shown that a bounded quiver algebra having a 2-truncated oriented cycle is of infinite Hochschild homology dimension and global dimension, which generalizes a result of Solotar and Vigu\'{e}-Poirrier to nonlocal ungraded algebras…

One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this form, it was first written down by Thomassen in 1978,…

We formulate a series of conjectures relating the geometry of conformal manifolds to the spectrum of local operators in conformal field theories in $d>2$ spacetime dimensions. We focus on conformal manifolds with limiting points at infinite…

We develop a general framework to study Szpiro's conjecture and the $abc$ conjecture by means of Shimura curves and their maps to elliptic curves, introducing new techniques that allow us to obtain several unconditional results for these…

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…

A polyellipse is a curve in the Euclidean plane all of whose points have the same sum of distances from finitely many given points (focuses). The classical version of Erd\H{o}s-Vincze's theorem states that regular triangles can not be…

We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…

The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimum rank distance $d$ that attains a…

We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$, we give exponential improvements for the best asymptotic upper bounds for this invariant under the…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…

The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…

The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…