Related papers: Graphs, defined by Weyl distance or incidence, tha…

We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…

We study the projections in vector spaces over finite fields. We prove finite fields analogues of the bounds on the dimensions of the exceptional sets for Euclidean projection mapping. We provide examples which do not have exceptional…

We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks…

Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…

A projective structure is Weyl metrizable if it has a representative that preserves a conformal structure. We interpret Weyl metrizability of 3-dimensional projective structures as certain 5-dimensional nondegenerate CR submanifolds in a…

In a quantum mechanical treatment of gauge theories (including general relativity), one is led to consider a certain completion, $\agb$, of the space $\ag$ of gauge equivalent connections. This space serves as the quantum configuration…

We consider a Weyl invariant extension of Dirac-Born-Infeld type gravity. An appropriate choice of the metric hides the scalar degree of freedom which is required by the local scale invariance of the action at the first sight, and then a…

Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…

We consider some conditions under which a smooth projective variety X is actually the projective space. We also extend to the case of positive characteristic some results in the theory of vector bundle adjunction. We use methods and…

Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…

The spatial preferred attachment (SPA) model is a model for networked information spaces such as domains of the World Wide Web, citation graphs, and on-line social networks. It uses a metric space to model the hidden attributes of the…

We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$…

In this paper, we present a generalization of the Askey-Wilson relations that involves a projective geometry. A projective geometry is defined as follows. Let $h>k\geq 1$ denote integers. Let $\mathbb{F}_{q}$ denote a finite field with $q$…

In a previous paper, we presented new results on non-Riemannian geometry. For an asymmetric connection, we showed that a projective change in the symmetric part generates a vector field that is not arbitrary, but is the gradient of a…

Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…

Graphical models can represent a multivariate distribution in a convenient and accessible form as a graph. Causal models can be viewed as a special class of graphical models that not only represent the distribution of the observed system…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…