Related papers: Some orbits of a two-vertex stabilizer in a Grassm…

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

We study distribution of orbits of a lattice \Gamma<SL(n,R) in the the space V_{n,l} of l-frames in R^n (1\le l\le n-1). Examples of dense \Gamma-orbits are known from the work of Dani, Raghavan, and Veech. We show that dense orbits of…

Let $R$ be a commutative ring with identity. We define a graph $\Gamma_{\aut}(R)$ on $ R$, with vertices elements of $R$, such that any two distinct vertices $x, y$ are adjacent if and only if there exists $\sigma \in \aut$ such that…

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

A graph $X$ is said to be unstable if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is…

In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…

Given a symmetric pair $(G,K)=(\mathrm{GL}_{p+q}(\mathbb{C}),\mathrm{GL}_{p}(\mathbb{C})\times \mathrm{GL}_{q}(\mathbb{C}))$ of type AIII, we consider the diagonal action of $K$ on the double flag variety…

We explicitly construct K-theoretic and elliptic stable envelopes for certain moduli spaces of vortices, and apply this to enumerative geometry of rational curves in these varieties. In particular, we identify the quantum difference…

A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser…

There exists the Krichever map from the set of quintets (C,p,F,t,e) (where C is an integral and complete algebraic curve, p a smooth rational point, F a rank 2 torsion free coherent sheaf on C, t a local formal parameter in p and e a formal…

The main result of this paper is that, if $\Gamma$ is a finite connected $4$-valent arc-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of $\Gamma$ fixes at most $1/3$…

In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$. We show that if the diameter is at least…

A unit ball graph consists of a set of vertices, labeled by points in Euclidean space, and edges joining all pairs of points within distance 1. These geometric graphs are used to model a variety of spatial networks, including communication…

Let $n\ge 1$ be an integer and $\mathbb{F}_q$ be a finite field of characteristic $p$ with $q$ elements. In this paper, it is proved that the Wenger graph $W_n(q)$ and linearized Wenger graph $L_m(q)$ are edge-girth-regular…

We consider the statics and dynamics of distinguishable spin-1/2 systems on an arbitrary graph G with N vertices. In particular, we consider systems of quantum spins evolving according to one of two hamiltonians: (i) the XY hamiltonian…

The study of circular orbits in spacetime is of astrophysical importance. The identification and classification of circular orbits in both static and stationary spacetimes remains an active area of interest. Even in the simplest static…

The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…

We consider the family of piecewise linear maps $$F_{a,b}(x,y)=\left(|x| - y + a, x - |y| + b\right),$$ where $(a,b)\in \mathbb{R}^2$. This family belongs to a wider one that has deserved some interest in the recent years as it provides a…

We define a version of stable maps into the classifying stack $B\mathrm{GL}_N$, and develop a corresponding notion of $K$-theoretic Gromov-Witten invariants. In this setting, the evaluation morphisms are not of finite type; the definition…