Related papers: Nets in groups, minimum length $g$-adic representa…
A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…
A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…
For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…
Inspired by Pythagoras's belief that numbers are the absolute reality, we obtain some demonstrational results about topological properties of integer networks, in which the vertices represent integers and two vertices are neighbors if and…
In recent years, Generative Adversarial Networks (GANs) have received significant attention from the research community. With a straightforward implementation and outstanding results, GANs have been used for numerous applications. Despite…
Degree heterogeneity and latent geometry, also referred to as popularity and similarity, are key explanatory components underlying the structure of real-world networks. The relationship between these components and the statistical…
In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…
For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it…
Given a graph, the shortest-path problem requires finding a sequence of edges with minimum cumulative length that connects a source vertex to a target vertex. We consider a variant of this classical problem in which the position of each…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…
Nominal assortativity (or discrete assortativity) is widely used to characterize group mixing patterns and homophily in networks, enabling researchers to analyze how groups interact with one another. Here we demonstrate that the measure…
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only…
In this paper, from a theoretical perspective, we study how powerful graph neural networks (GNNs) can be for learning approximation algorithms for combinatorial problems. To this end, we first establish a new class of GNNs that can solve a…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…