Related papers: The two-point function of bicolored planar maps
We study a ridge estimator for the high-dimensional two-way fixed effect regression model with a sparse bipartite network. We develop concentration inequalities showing that when the ridge parameters increase as the log of the network size,…
We consider mixed type multiple orthogonal polynomials associated with a system of weight functions consisting of two vectors. One vector is defined in terms of scaled modified Bessel function of the first kind $I_\mu$ and $I_{\mu+1}$, the…
This paper focuses on identifying vertex characteristics in 2D images using topological asymptotic analysis. Vertex characteristics include both the location and the type of the vertex, with the latter defined by the number of lines forming…
We derive exact analytic results for several four-point correlation functions for statistical models exhibiting phase separation in two-dimensions. Our theoretical results are then specialized to the Ising model on the two-dimensional strip…
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of colors so that adjacent vertices have different colors. In…
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in…
A reflection mapping is a singular holomorphic mapping obtained by restricting the quotient mapping of a complex reflection group. We study the analytic structure of double point spaces of reflection mappings. In the case where the image is…
We calculate holographically three-point functions of scalar operators with large dimensions at finite density and finite temperature. To achieve this, we construct new solutions that involve two isometries of the deformed internal space.…
A $t$-tone coloring of a graph $G$ assigns to each vertex a set of $t$ colors such that any pair of vertices $u, v$ with distance $d$ can share at most $d-1$ colors. In this note, we prove several new results on $t$-tone coloring. For…
We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of…
Since their introduction in the shape analysis community, functional maps have met with considerable success due to their ability to compactly represent dense correspondences between deformable shapes, with applications ranging from shape…
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bipartite graph naturally gives rise to a random intersection…
We compare two different types of mapping class invariants: the Hochschild homology of an $A_\infty$ bimodule coming from bordered Heegaard Floer homology, and fixed point Floer cohomology. We first compute the bimodule invariants and their…
A proper vertex coloring of a graph is a mapping of its vertices on a set of colors, such that two adjacent vertices are not mapped to the same color. This constraint may be interpreted in terms of the distance between to vertices and so a…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…