Related papers: Transformations of 2-port networks and tiling by r…
We study planar straight-line drawings of graphs that minimize the ratio between the length of the longest and the shortest edge. We answer a question of Lazard et al. [Theor. Comput. Sci. 770 (2019), 88--94] and, for any given constant…
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which is associated with a point in the plane, a disk is drawn centered on v with a radius that is alpha times the…
We construct and analyze approximation rates of deep operator networks (ONets) between infinite-dimensional spaces that emulate with an exponential rate of convergence the coefficient-to-solution map of elliptic second-order partial…
Consider a face-to-face parallelohedral tiling of $\mathbb R^d$ and a $(d-k)$-dimensional face $F$ of the tiling. We prove that the valence of $F$ (i.e. the number of tiles containing $F$ as a face) is not greater than $2^k$. If the tiling…
We show the existence of an exact mimicking network of $k^{O(\log k)}$ edges for minimum multicuts over a set of terminals in an undirected graph, where $k$ is the total capacity of the terminals, as well as a method for computing a…
We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.
In 1992, Brehm and K\"uhnel constructed a 8-dimensional simplicial complex $M^8_{15}$ with 15 vertices as a candidate to be a minimal triangulation of the quaternionic projective plane. They managed to prove that it is a manifold "like a…
This paper studies properties of tilings of the plane by parallelograms. In particular it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
We introduce an output layer for neural networks that ensures satisfaction of convex constraints. Our approach, $\Pi$net, leverages operator splitting for rapid and reliable projections in the forward pass, and the implicit function theorem…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…
A technique of designing antenna excitation realizing orthogonal states is presented. It is shown that a symmetric antenna geometry is required in order to achieve orthogonality with respect to all physical quantities. A maximal number of…
This paper introduces an extension of the backpropagation algorithm that enables us to have layers with constrained weights in a deep network. In particular, we make use of the Riemannian geometry and optimization techniques on matrix…
Let $S$ be a connected closed oriented surface of genus $g$. Given a triangulation (resp. quadrangulation) of $S$, define the index of each of its vertices to be the number of edges originating from this vertex minus $6$ (resp. minus $4$).…
Tensor network contraction is a powerful computational tool in quantum many-body physics, quantum information and quantum chemistry. The complexity of contracting a tensor network is thought to mainly depend on its entanglement properties,…
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a…
The pentagram map takes a planar polygon $P$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$. This map is known to interact nicely with Poncelet polygons, i.e. polygons which are…