Related papers: Exact Meander Asymptotics: a Numerical Check
In this article we study the linearized anisotropic Calder\'on problem on a compact Riemannian manifold with boundary. This problem amounts to showing that products of pairs of harmonic functions of the manifold form a complete set. We…
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of computer networks, is the problem of partitioning a given…
A unified expression for topological invariants has been proposed recently to describe the topological order in Dirac models belonging to any dimension and symmetry class. We uncover a correspondence between the curvature function that…
We propose an efficient algorithm to numerically solve Anderson impurity problems using matrix product states. By introducing a modified chain mapping we obtain significantly lower entanglement, as compared to all previous attempts, while…
We study two types of random matrix ensembles that emerge when considering the same probability measure on partitions. One is the Meixner ensemble with a hard wall and the other are two families of unitary matrix models, with weight…
We propose the Cyclic Permutation Test (CPT) to test general linear hypotheses for linear models. This test is non-randomized and valid in finite samples with exact Type I error $\alpha$ for an arbitrary fixed design matrix and arbitrary…
In the present paper we consider the varying coefficient model which represents a useful tool for exploring dynamic patterns in many applications. Existing methods typically provide asymptotic evaluation of precision of estimation…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable…
One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…
We evaluate the configuration exponents of various ensembles of Hamiltonian paths drawn on random planar bicubic maps. These exponents are estimated from the extrapolations of exact enumeration results for finite sizes and compared with…
In this paper we develop a general framework for constructing and analysing coupled Markov chain Monte Carlo samplers, allowing for both (possibly degenerate) diffusion and piecewise deterministic Markov processes. For many performance…
We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem,…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
We construct and investigate a family of two-band unitary systems living on a cylinder geometry and presenting localized edge states. Using the transfer matrix formalism, we solve and investigate in details such states in the thermodynamic…
This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…
These notes give an introduction to the equivalence problem of sub-Riemannian manifolds. We first introduce preliminaries in terms of connections, frame bundles and sub-Riemannian geometry. Then we arrive to the main aim of these notes,…
We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$…
We develop a method for computing all the {\it generalized asymptotes} of a real plane algebraic curve $\cal C$ over $\Bbb C$ implicitly defined by an irreducible polynomial $f(x,y)\in {\Bbb R}[x,y]$. The approach is based on the notion of…