Related papers: Some regular symmetric pairs

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

Let $A$ be a unital C$^*$-algebra with unity $1_A$. A pair of elements $0 \le a, b \le 1_A$ in $A$ is said to be \emph{absolutely compatible} if, $\vert a - b \vert + \vert 1_A - a - b \vert = 1_A.$ In this paper we provide a complete…

Over any field $\mathbb K$, there is a bijection between regular spreads of the projective space ${\rm PG}(3,{\mathbb K})$ and $0$-secant lines of the Klein quadric in ${\rm PG}(5,{\mathbb K})$. Under this bijection, regular parallelisms of…

It was conjectured by Mkrtchyan, Petrosyan, and Vardanyan that every graph $G$ with $\Delta(G)-\delta(G) \le 1$ has a maximum matching $M$ such that any two $M$-unsaturated vertices do not share a neighbor. In this note, we confirm the…

We consider a see-saw pair consisting of a Hermitian symmetric pair (G_R, K_R) and a compact symmetric pair (M_R, H_R), where (G_R, H_R) and (K_R, M_R) form real reductive dual pairs in a large symplectic group. In this setting, we get…

The n-dimensional pair of pants is defined to be the complement of n+2 generic hyperplanes in CP^n. We construct an immersed Lagrangian sphere in the pair of pants and compute its endomorphism A_{\infty} algebra in the Fukaya category. On…

A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…

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 present a brief review of exact solutions of cylindrical symmetric fields in General Relativity produced by different perfect fluid sources. These sources are assumed static, stationary, translating and collapsing. Properties of these…

A pure pair in a graph $G$ is a pair $A,B$ of disjoint subsets of $V(G)$ such that $A$ is complete or anticomplete to $B$. Jacob Fox showed that for all $\epsilon>0$, there is a comparability graph $G$ with $n$ vertices, where $n$ is large,…

Let $G$ be a compact connected Lie group and let H be a subgroup fixed by an involution. A classical result assures that the action of the complex reductive group $H_C$ on the flag variety $F$ of $G$ admits a finite number of orbits. In…

This is my PhD thesis submitted to the Weizmann Institute of Science. It is based on the papers [AG08c], [AG08d], [AGRS07], [AGS08], [AGS09], [Aiz08] and [SZ08]. This thesis includes an introduction to Gelfand pairs and invariant…

In a recent preprint Kodiyalam and Verma give a particularly simple Gelfand model for the symmetric group that is built naturally on the space of involutions. In this manuscript we give a natural extension of Kodiyalam and Verma's model to…

We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…

The family $\mathcal{OG}(4)$ consisting of graph-group pairs $(\Gamma, G)$, where $\Gamma$ is a finite, connected, 4-valent graph admitting a $G$-vertex-, and $G$-edge-transitive, but not $G$-arc-transitive action, has recently been…

We study parity symmetries and crosscap states in classes of N=2 supersymmetric quantum field theories in 1+1 dimensions, including non-linear sigma models, gauged WZW models, Landau-Ginzburg models, and linear sigma models. The parity…

Gaussian and Chiral Beta-Ensembles, which generalise well known orthogonal (Beta=1), unitary (Beta=2), and symplectic (Beta=4) ensembles of random Hermitian matrices, are considered. Averages are shown to satisfy duality relations like…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

Let $K$ denote an algebraically closed field with characteristic 0 and let $V$ denote a vector space over $K$ with finite positive dimension. Let $A,A^*$ denote a tridiagonal pair on $V$ with diameter $d$. We say that $A,A^*$ has Krawtchouk…