Related papers: Separated Nets in Nilpotent Groups

Let $G$ be a classical linear algebraic group over an algebraically closed field, and let $\mathfrak{n}$ denote the subset of nilpotent elements in its Lie algebra. In this paper we study a partial order on the $G$-orbits in $\mathfrak{n}$…

We minimize a linear combination of the Willmore and the length functional among networks in $\mathbb{R}^d$ belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the…

Deep residual networks (ResNets) have demonstrated outstanding success in computer vision tasks, attributed to their ability to maintain gradient flow through deep architectures. Simultaneously, controlling the Lipschitz constant in neural…

We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…

This note is concerned with the geometric classification of connected Lie groups of dimension three or less, endowed with left-invariant Riemannian metrics. On the one hand, assembling results from the literature, we give a review of the…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

We show that every finite-dimensional Euclidean space contains compact universal differentiability sets of upper Minkowski dimension one. In other words, there are compact sets $S$ of upper Minkowski dimension one such that every Lipschitz…

While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…

In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…

In this paper, we introduce ergodic sets, subsets of nodes of the networks that are dynamically disjoint from the rest of the network (i.e. that can never be reached or left following to the network dynamics). We connect their definition to…

A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

Non-transitive subgroups of the orthogonal group play an important role in the non-Euclidean geometry. If $G$ is a closed subgroup in the orthogonal group such that the orbit of a single Euclidean unit vector does not cover the (Euclidean)…

We obtain a bi-Lipschitz rigidity theorem for a Zariski dense discrete subgroup of a connected simple real algebraic group. As an application, we show that any Zariski dense discrete subgroup of a higher rank semisimple algebraic group $G$…

We develop the theoretical foundations of a generalized Gromov-Hausdorff distance between functions on networks that has recently been applied to various subfields of topological data analysis and optimal transport. These functional…

We consider the unitary group $\U$ of complex, separable, infinite-dimensional Hilbert space as a discrete group. It is proved that, whenever $\U$ acts by isometries on a metric space, every orbit is bounded. Equivalently, $\U$ is not the…

This note shows that, for a fixed Lipschitz constant $L > 0$, one layer neural networks that are $L$-Lipschitz are dense in the set of all $L$-Lipschitz functions with respect to the uniform norm on bounded sets.

In this paper we consider an initial-boundary value problem related to some network dynamics where the underlying graph has unbounded edges. We show that there exists a C0-semigroup for this problem using a general result from the…

We show that certain lamplighter groups that are quasi-isometric to each other are not bilipschitz equivalent. This gives a positive answer to a question in Topics in Geometric Group Theory by Pierre de la Harpe (page 107).

We say that a sequence of proper geodesic spaces $X_n$ consists of \textit{almost homogeneous spaces} if there is a sequence of discrete groups of isometries $G_n \leq \text{Iso}(X_n)$ with $\text{diam} (X_n/G_n)\to 0$ as $n \to \infty$. We…