相关论文: Exact Meander Asymptotics: a Numerical Check

We consider the problem of finding complete conformal metrics with prescribed curvature functions of the Einstein tensor and of more general modified Schouten tensors. To achieve this, we reveal an algebraic structure of a wide class of…

The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…

A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph…

Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…

We call a real multi-dimensional array a {\em tensor} for short. In enumerating vertices of the polytopes of stochastic tensors, different approaches have been used: {(1)} Combinatorial method via Latin squares; {(2)} Analytic (topological)…

We present a set of conditions which, if satisfied, provide for a complete asymptotic analysis of random matrices with source term containing two distinct eigenvalues. These conditions are shown to be equivalent to the existence of a…

These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

We study the following question: given a set P of 3d-2 points and an immersed curve G in the real plane R^2, all in general position, how many real rational plane curves of degree d pass through these points and are tangent to this curve.…

The geometry of the set of restrictions of rank-one tensors to some of their coordinates is studied. This gives insight into the problem of rank-one completion of partial tensors. Particular emphasis is put on the semialgebraic nature of…

Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…

Comparing alternatives in pairs is a very well known technique of ranking creation. The answer to how reliable and trustworthy ranking is depends on the inconsistency of the data from which it was created. There are many indices used for…

The Mapper algorithm does not include a check for whether the cover produced conforms to the requirements of the nerve lemma. To perform a check for obstructions to the nerve lemma, statistical considerations of multiple testing quickly…

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…

Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…

We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…

We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path…

We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…