arXiv subjects
Publications and source records attributed to Ran J. Tessler.
We show that a generating function for open $r$-spin enumerative invariants produces a universal unfolding of the polynomial $x^r$. Further, the coordinates parametrizing this universal unfolding are flat coordinates on the Frobenius manifold associated to the Landau-Ginzburg model $(\mathbb{C},x^r)$ via Saito-Givental theory. This result provides evidence for the same phenomenon to occur in higher dimension, proven in a sequel paper.
We define a theory of descendent integration on the moduli spaces of stable pointed disks. The descendent integrals are proved to be coefficients of the $τ$-function of an open KdV heirarchy. A relation between the integrals and a representation of half the Virasoro algebra is also proved. The construction of the theory requires an in depth study of homotopy classes of multivalued boundary conditions. Geometric recursions based on the combined structure of the boundary conditions and the moduli space are used to compute the integrals. We also provide a detailed analysis of orientations. Our open KdV and Virasoro constraints uniquely specify a theory of higher genus open descendent integrals. As a result, we obtain an open analog (governing all genera) of Witten's conjectures concerning descendent integrals on the Deligne-Mumford space of stable curves.
In recent works, [20],[21], descendent integrals on the moduli space of Riemann surfaces with boundary were defined. It was conjectured in [20] that the generating function of these integrals satisfies the open KdV equations. In this paper we develop the notions of symmetric Strebel-Jenkins differentials and of Kasteleyn orientations for graphs embedded in open surfaces. In addition we write an explicit expression for the angular form of the sum of line bundles. Using these tools we prove a formula for the descendent integrals in terms of sums over weighted graphs. Based on this formula, the conjecture of [20] was proved in [5].
In this work we introduce a new notion of expansion in higher dimensions that is stronger than the well studied cosystolic expansion notion, and is termed {\em Collective-cosystolic expansion}. We show that tensoring two cosystolic expanders yields a new cosystolic expander, assuming one of the complexes in the product, is not only cosystolic expander, but rather a collective cosystolic expander. We then show that the well known bounded degree cosystolic expanders, the Ramanujan complexes are, in fact, collective cosystolic expanders. This enables us to construct new bounded degree cosystolic expanders, by tensoring of Ramanujan complexes. Using our new constructed bounded degree cosystolic expanders we construct {\em explicit} quantum LDPC codes of distance $\sqrt{n} \log^k n$ for any $k$, improving a recent result of Evra et. al. \cite{EKZ}, and setting a new record for distance of explicit quantum LDPC codes. The work of \cite{EKZ} took advantage of the high dimensional expansion notion known as cosystolic expansion, that occurs in Ramanujan complexes. Our improvement is achieved by considering tensor product of Ramanujan complexes, and using their newly derived property, the collective cosystolic expansion.
We lay the foundation for a version of $r$-spin theory in genus zero for Riemann surfaces with boundary. In particular, we define the notion of $r$-spin disks, their moduli space, and the Witten bundle, we show that the moduli space is a compact smooth orientable orbifold with corners, and we prove that the Witten bundle is canonically relatively oriented relative to the moduli space. In the sequel to this paper, we use these constructions to define open $r$-spin intersection theory and relate it to the Gelfand-Dickey hierarchy, thus providing an analogue of Witten's $r$-spin conjecture in the open setting.
In a recent work, R. Pandharipande, J. P. Solomon and the second author have initiated a study of the intersection theory on the moduli space of Riemann surfaces with boundary. They conjectured that the generating series of the intersection numbers satisfies the open KdV equations. In this paper we prove this conjecture. Our proof goes through a matrix model and is based on a Kontsevich type combinatorial formula for the intersection numbers that was found by the second author.
We study a generalization of genus-zero $r$-spin theory in which exactly one insertion has a negative-one twist, which we refer to as the "closed extended" theory, and which is closely related to the open $r$-spin theory of Riemann surfaces with boundary. We prove that the generating function of genus-zero closed extended intersection numbers coincides with the genus-zero part of a special solution to the system of differential equations for the wave function of the $r$-th Gelfand-Dickey hierarchy. This parallels an analogous result for the open $r$-spin generating function in the companion paper to this work.
A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to a d-dimensional sphere. We consider the Linial-Meshulam model for random simplicial complexes, and prove that there is a sharp threshold at $p=\sqrt{\frac{e}{γn}}$ for the appearance of a Hamiltonian $2$-sphere in a random $2$-complex, where $γ= 4^4/3^3$.
A classical longstanding open problem in statistics is finding an explicit expression for the probability measure which maximizes entropy with respect to given constraints. In this paper a solution to this problem is found, using perturbative Feynman calculus. The explicit expression is given as a sum over weighted trees.
We prove a weighted generalization of the formula for the number of plane vertex-labeled trees.
A study of the intersection theory on the moduli space of Riemann surfaces with boundary was recently initiated in a work of R. Pandharipande, J. P. Solomon and the third author, where they introduced open intersection numbers in genus 0. Their construction was later generalized to all genera by J. P. Solomon and the third author. In this paper we consider a refinement of the open intersection numbers by distinguishing contributions from surfaces with different numbers of boundary components, and we calculate all these numbers. We then construct a matrix model for the generating series of the refined open intersection numbers and conjecture that it is equivalent to the Kontsevich-Penner matrix model. An evidence for the conjecture is presented. Another refinement of the open intersection numbers, which describes the distribution of the boundary marked points on the boundary components, is also discussed.
We consider the Edwards-Anderson Ising Spin Glass model for non negative temperatures T: We define the natural notion of Boltzmann- Gibbs measure for the Edwards-Anderson spin glass at a given temperature, and of unsatisfied edges. We prove that for low enough temperatures, in almost every spin configuration the graph formed by the unsatisfied edges is made of finite connected components. In other words, the unsatisfied edges do not percolate.
We consider a group of agents connected by a social network who participate in majority dynamics: each agent starts with an opinion in {-1,+1} and repeatedly updates it to match the opinion of the majority of its neighbors. We assume that one of {-1,+1} is the "correct" opinion S, and consider a setting in which the initial opinions are independent conditioned on S, and biased towards it. They hence contain enough information to reconstruct S with high probability. We ask whether it is still possible to reconstruct S from the agents' opinions after many rounds of updates. While this is not the case in general, we show that indeed, for a large family of bounded degree graphs, information on S is retained by the process of majority dynamics. Our proof technique yields novel combinatorial results on majority dynamics on both finite and infinite graphs, with applications to zero temperature Ising models.
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a complex, and the spectrum of the high dimensional Laplacian defined by Eckmann. In particular, we present a Cheeger-type inequality, and a high-dimensional Expander Mixing Lemma. As a corollary, using the work of Pach, we obtain a connection between spectral properties of complexes and Gromov's notion of geometric overlap. Using the work of Gunder and Wagner, we give an estimate for the combinatorial expansion and geometric overlap of random Linial-Meshulam complexes.
We consider the Williams Bjerknes model, also known as the biased voter model on the $d$-regular tree $\bbT^d$, where $d \geq 3$. Starting from an initial configuration of "healthy" and "infected" vertices, infected vertices infect their neighbors at Poisson rate $λ\geq 1$, while healthy vertices heal their neighbors at Poisson rate 1. All vertices act independently. It is well known that starting from a configuration with a positive but finite number of infected vertices, infected vertices will continue to exist at all time with positive probability iff $λ> 1$. We show that there exists a threshold $λ_c \in (1, \infty)$ such that if $λ> λ_c$ then in the above setting with positive probability all vertices will become eventually infected forever, while if $λ< λ_c$, all vertices will become eventually healthy with probability 1. In particular, this yields a complete convergence theorem for the model and its dual, a certain branching coalescing random walk on $\bbT^d$ -- above $λ_c$. We also treat the case of initial configurations chosen according to a distribution which is invariant or ergodic with respect to the group of automorphisms of $\bbT^d$.
We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing matching? We first address the case where the boundary of the convex hull of the original graph contains at most $n + 1$ points. In this case we show that n edges can be removed, one more than the general case. In the second part we establish a lower bound for the case where the $2n$ points are randomly chosen. We prove that with probability which tends to 1, one can remove any $n + Θ(n/log (n))$ edges but the residual graph will still contain a non-crossing perfect matching. We also discuss the upper bound for the number of arbitrary edges one must remove in order to eliminate all the non-crossing perfect matchings.
Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite graph $G$ containing at least one edge, there is no harmonic labeling of $ G \times \Z$.