English
Related papers

Related papers: On uniform Higmanian association schemes

200 papers

Let $G$ be $\SO(n,1)$ or $\SU(n,1)$ and let $\Gamma\subset G$ denote an arithmetic lattice. The hyperbolic manifold $\Gamma\backslash \calH$ comes with a natural family of covers, coming from the congruence subgroups of $\Gamma$. In many…

Number Theory · Mathematics 2010-11-18 Dubi Kelmer , Lior Silberman

This paper examines the classification of hyperbolic equations. We study a class of equations of the form $$\frac{\partial^2 u}{\partial x\partial y}=F\left(\frac{\partial u}{\partial x},\frac{\partial u}{\partial y},u\right),$$ where…

Analysis of PDEs · Mathematics 2026-01-01 Rustem N. Garifullin

Let $M$ be an Anderson t-motive of dimension $n$ and rank $r$. Associated are two $\Bbb F_q[T]$-modules $H^1(M)$, $H_1(M)$ of dimensions $h^1(M)$, $h_1(M)\le r$ - analogs of $H^1(A,\Bbb Z)$, $H_1(A,\Bbb Z)$ for an abelian variety $A$. There…

Number Theory · Mathematics 2021-01-05 Aleksandr Grishkov , Dmitry Logachev

In this paper, we present several necessary and sufficient conditions for a harmonic mapping to be normal. Also, we discuss maximum principle and five-point theorem for normal harmonic mappings. Furthermore, we investigate the convergence…

Complex Variables · Mathematics 2020-09-01 Hua Deng , Saminathan Ponnusamy , Jinjing Qiao

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we study 4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of skew-symmetric…

Combinatorics · Mathematics 2011-07-05 Jianmin Ma , Kaishun Wang

We study a sequence of connections which is associated with a Riemannian metric and an almost symplectic structure on a manifold. We prove that if this sequence is trivial (i.e. constant) or 2-periodic, then the manifold has a canonical…

Differential Geometry · Mathematics 2007-05-23 Mikhail Shubin

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…

Differential Geometry · Mathematics 2016-03-03 Tracy L. Payne , Matthew Schroeder

Large families of Hamiltonians that are non-Hermitian in the conventional sense have been found to have all eigenvalues real, a fact attributed to an unbroken PT symmetry. The corresponding quantum theories possess an unconventional scalar…

Quantum Physics · Physics 2009-11-11 Zafar Ahmed , Carl M. Bender , M. V. Berry

In earlier papers, we showed a decomposition of the arcs of 2-diregular digraphs (2-dds) and used it to prove some conditions for these graphs to be non-Hamiltonian; we then extended this decomposition to a larger class of digraphs and used…

Combinatorics · Mathematics 2026-01-27 Munagala V. Ramanath

We consider |\Delta F| = 1 (F = S,C or B) nonleptonic effective hamiltonian in a renormalization scheme which allows to consistently use fully anticommuting gamma_5 at any number of loops, but at the leading order in the Fermi coupling G_F.…

High Energy Physics - Phenomenology · Physics 2011-01-27 Konstantin Chetyrkin , Mikolaj Misiak , Manfred Muenz

We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the…

Probability · Mathematics 2011-09-20 Russell Lyons , Fedor Nazarov

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…

Rings and Algebras · Mathematics 2025-10-22 Mykola Khrypchenko

A graph $G$ is $l$-path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. It is well known that a 2-connected, $k$-regular graph $G$ on at most $3k-1$ vertices is edge-Hamiltonian if for every edge…

Combinatorics · Mathematics 2022-03-10 Xia Li , Weihua Yang

In this paper, we provide a complete regularity analysis for an abstract system of coupled hyperbolic and parabolic equations in a complex Hilbert space. We are able to decompose the unit square of the parameters into three parts where the…

Analysis of PDEs · Mathematics 2014-04-25 Jianghao Hao , Zhuangyi Liu , Jiongmin Yong

The Grassmannian model represents harmonic maps from Riemann surfaces by families of shift-invariant subspaces of a Hilbert space. We impose a natural symmetry condition on the shift-invariant subspaces that corresponds to considering an…

Functional Analysis · Mathematics 2019-12-06 Alexandru Aleman , Rui Pacheco , John C. Wood

A pair of sequences of natural numbers is called planar if there exists a simple, bipartite, planar graph for which the given sequences are the degree sequences of its parts. For a pair to be planar, the sums of the sequences have to be…

Combinatorics · Mathematics 2018-05-08 Patrick Adams , Yuri Nikolayevsky

In [Graphs Combin.~24 (2008) 469--483.], the third author and the fifth author conjectured that if $G$ is a $k$-connected graph such that $\sigma_{k+1}(G) \ge |V(G)|+\kappa(G)+(k-2)(\alpha(G)-1)$, then $G$ contains a Hamiltonian cycle,…

Combinatorics · Mathematics 2018-04-05 S. Chiba , M. Furuya , K. Ozeki , M. Tsugaki , T. Yamashita

In this paper, we present some upper bounds for unitarily invariant norms inequalities. Among other inequalities, we show some upper bounds for the Hilbert-Schmidt norm. In particular, we prove \begin{align*} \|f(A)Xg(B)\pm…

Functional Analysis · Mathematics 2018-01-10 Mojtaba Bakherad

It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that…

Combinatorics · Mathematics 2015-01-29 Marco Buratti , Graham J. Lovegrove , Tommaso Traetta

Automatic structures are finitely presented structures where the universe and all relations can be recognized by finite automata. It is known that the isomorphism problem for automatic structures is complete for $\Sigma^1_1$; the first…

Logic in Computer Science · Computer Science 2010-01-14 Dietrich Kuske , Jiamou Liu , Markus Lohrey