Related papers: On uniform Higmanian association schemes
This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a…
An association scheme is called quasi-thin if the valency of each its basic relation is one or two. A quasi-thin scheme is Kleinian if the thin residue of it forms a Klein group with respect to the relation product. It is proved that any…
Let G be a simple simply-connected group scheme over a regular local scheme U. Let E be a principal G-bundle over A^1_U trivial away from a subscheme finite over U. We show that E is not necessarily trivial and give some criteria of…
We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…
In this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree…
Let $\Gamma$ be a finitely generated group which is hyperbolic relative to a finite family $\{H_1,...,H_n\}$ of subgroups. We prove that $\Gamma$ is uniformly embeddable in a Hilbert space if and only if each subgroup $H_i$ is uniformly…
In this article, we focus on association schemes with some properties derived from the orbitals of a transitive permutation group $G$ with a one-point stabilizer $H$ satisfying $H <N_G(H)<N_G(N_G(H))\unlhd G$ and $|N_G(N_G(H))|=p^3$ where…
Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence…
We show that Hilbert schemes of points on supersingular Enriques surface in characteristic 2 are simply connected, symplectic varieties but are not irreducible symplectic as the hodge number $h^{2,0} > 1$, even though a supersingular…
We present {\it symmetric Hamiltonians} for the degenerate Garnier systems in two variables. For these symmetric Hamiltonians, we make the symmetry and holomorphy conditions, and we also make a generalization of these systems involving…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
Bi-Hamiltonian structures are of great importance in the theory of integrable Hamiltonian systems. The notion of compatibility of symplectic structures is a key aspect of bi-Hamiltonian systems. Because of this, a few different notions of…
A subset S of a Riemannian manifold N is called extrinsically homogeneous if S is an orbit of a subgroup of the isometry group of N. Thorbergsson proved the remarkable result that every complete, connected, full, irreducible isoparametric…
A pair of disjoint lines on a smooth cubic threefold determines an irreducible component of the Hilbert scheme. We prove that this component is smooth and isomorphic to the blow-up of the symmetric product of Fano varieties of lines on the…
In this paper, we study the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model. In this model, vertices are added to the graph one by one, and each time a new vertex is created it establishes a…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
Assume G is a finite group, such that |G|= 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph Cay(G;S).
A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…
Several families of rank-two vector bundles on Hirzebruch surfaces are shown to consist of all very ample, uniform bundles. Under suitable numerical assumptions, the projectivization of these bundles, embedded by their tautological line…