相关论文: Planar $3$-webs and the boundary measurement matri…

In this paper, a novel 3D deep learning network is proposed for brain MR image segmentation with randomized connection, which can decrease the dependency between layers and increase the network capacity. The convolutional LSTM and 3D…

An extension of the Ising model is proposed as a viable alternative for data with values $-1$, $0$ and $+1$ in the inverse problem, i.e., estimation of the parameters. This model is called the Blume-Capel (BC) model, adapted from physics…

It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…

The three-page index $\alpha_3(L)$ is an invariant that measures the complexity of representing a link $L$ in a three-page book. It is known that $\alpha_3(L)$ admits a linear upper bound in terms of the crossing number, with equality…

Tetrahedral frame fields have applications to certain classes of nematic liquid crystals and frustrated media. We consider the problem of constructing a tetrahedral frame field in three dimensional domains in which the boundary normal…

Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…

In this article, we study some properties of the $n$-th order weighted reduced Bergman kernels for planar domains, $n\geq 1$. Specifically, we look at Ramadanov type theorems, localization, and boundary behaviour of the weighted reduced…

We establish the optimal lower bound $\gtrsim N$ for counting the number of distinct inner products of pairs from any $N$ given vectors in $\R^2$. Essentially, we lift a related incidence structure defined by inner products in the plane to…

The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…

The object of the paper is to find complete systems of inequalities relating the perimeter $P$, the area $|\cdot|$ and the Cheeger constant $h$ of planar sets. To do so, we study the so called Blaschke--Santal\'o diagram of the triplet…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…

We define combinatorial invariants of Legendrian and transverse links in universally tight lens spaces using grid diagrams, generalizing [OST08] and prove that they are equivalent to the invariants defined in [BVVV13] and [LOSS09]. We use…

We review the application of the notion of local convergence on locally finite randomly rooted graphs, known as Benjamini-Schramm convergence, to the calculation of the global eigenvalue density of random matrices from the beta-Gaussian and…

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

We introduce a general framework for analyzing data modeled as parameterized families of networks. Building on a Gromov-Wasserstein variant of optimal transport, we define a family of parameterized Gromov-Wasserstein distances for comparing…

We study online convex optimisation with $\ell_q$-Lipschitz losses, $\ell_p$-regularised FTRL, and randomised two-point finite-difference gradient estimators based on cone-measure sampling from $\ell_r$-spheres. For random Lipschitz losses…

We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for bilinear functions, which include computation of matrix…

We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are…

We give a complete proof of the fact that the trace of the curvature of the connection associated to a planar d-web (d>3) is the sum of the Blaschke curvatures of its sub 3-webs.

We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…