Related papers: On the Circuit Diameter Conjecture for Counterexam…
In this article, we study the dynamical properties of Reeb vector fields on b-contact manifolds. We show that in dimension 3, the number of so-called singular periodic orbits can be prescribed. These constructions illuminate some key…
For every fixed graph $H$, it is known that homomorphism counts from $H$ and colorful $H$-subgraph counts can be determined in $O(n^{t+1})$ time on $n$-vertex input graphs $G$, where $t$ is the treewidth of $H$. On the other hand, a running…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
We develop a small-data Maxwell--Higgs theory on Schwarzschild and slowly rotating Kerr black-hole exteriors for gauge-invariant nonnegative self-interactions near the trivial vacuum. The Schwarzschild part gives a complete global,…
In the weakened 16th Hilbert's Problem one asks for a bound of the number of limit cycles which appear after a polynomial perturbation of a planar polynomial Hamiltonian vector field. It is known that this number is finite for an individual…
The Schur square of linear codes over a finite field has emerged as a fundamental operation in both classical and quantum coding theory. In this paper, we investigate the Schur square problem of Hyperderivative Reed-Solomon (HRS) codes. By…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
Succinct representations of a graph have been objects of central study in computer science for decades. In this paper, we study the operation called \emph{Distance Preserving Graph Contractions}, which was introduced by Bernstein et al.…
In a recent letter, a simple method was proposed to generate solvable models that predict the critical properties of statistical systems in hyperspherical geometries. To that end, it was shown how to reduce a random walk in $D$ dimensions…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…
This paper is motivated by the problem of quantitatively bounding the convergence of adaptive control methods for stochastic systems to a stationary distribution. Such bounds are useful for analyzing statistics of trajectories and…
We provide exposition into the field of projection theory, which lies at the intersection of incidence geometry and geometric measure theory. We first give the necessary preliminaries in Chapter 2, focusing on incidences between points and…
Ferrers diagram rank-metric codes were introduced by Etzion and Silberstein in 2009. In their work, they proposed a conjecture on the largest dimension of a space of matrices over a finite field whose nonzero elements are supported on a…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in $r$-partite $r$-uniform hypergraphs, Lov\'asz formulated a stronger conjecture. It states that one can always reduce the matching…
In this paper we give a geometric argument for bounding the diameter of a connected compact surface (with boundary) of arbitrary codimension in Euclidean space in terms of Topping's diameter bound for closed surfaces (without boundary). The…
We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…
We aim to revive Thorup's conjecture [Thorup, WG'92] on the existence of reachability shortcuts with ideal size-diameter tradeoffs. Thorup originally asked whether, given any graph $G=(V,E)$ with $m$ edges, we can add $m^{1+o(1)}$…
Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness against various classes of test functions, including…