Related papers: On the intersection density of the symmetric group…

For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp.…

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ such that the pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. Let $n$ and $r$ be positive integers with $n>2r$. The symmetric and…

Let $R$ be a commutative ring and $M$ be an $R$-module, and let $I(R)^*$ be the set of all non-trivial ideals of $R$. The $M$-intersection graph of ideals of $R$, denoted by $G_M(R)$, is a graph with the vertex set $I(R)^*$, and two…

In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate…

We asymptotically determine the maximum density of subgraphs isomorphic to $H$, where $H$ is any graph containing a dominating vertex, in graphs $G$ on $n$ vertices with bounded maximum degree and bounded clique number. That is, we…

If $G$ acts on a $C^*$-correspondence ${\mathcal H}$, then by the universal property $G$ acts on the Cuntz-Pimsner algebra ${\mathcal O}_{\mathcal H}$ and we study the crossed product ${\mathcal O}_{\mathcal H}\rtimes G$ and the fixed point…

A graph $G$ is $m$-joined if there is an edge between every two disjoint $m$-sets of vertices. In this paper, we prove that for any $\varepsilon>0$ and sufficiently large $m, n\in \mathbb{N}$ with $m \le n^{1-\varepsilon}$, every $n$-vertex…

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

We approximate intersection numbers $\big\langle \psi_1^{d_1}\cdots \psi_n^{d_n}\big\rangle_{g,n}$ on Deligne-Mumford's moduli space $\overline{\mathcal M}_{g,n}$ of genus $g$ stable complex curves with $n$ marked points by certain…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-$t$-intersecting if each set in $\mathcal{A}$ intersects each set in $\mathcal{B}$ in at least $t$ elements. An active problem in extremal set theory is to determine…

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

A group $G$ is said to be intersection-saturated if for every strictly positive integer $n$ and every map $c\colon \mathcal{P}(\{1,\dots, n\})\setminus \emptyset \rightarrow \{0,1\}$, one can find subgroups $H_1,\dots, H_n\leq G$ such that…

Let $G=(V,E)$ be a simple graph. For a nonempty set $X\subset V,$ and a vertex $v\in V,$ $\delta_{X}(v)$ denotes the number of neighbors $v$ has in $X.$ A nonempty set $S\subset V$ is an \emph{offensive $r$-alliance} in $G$ if…

The Birkhoff polytope $\Omega_n$ is the polytope of doubly stochastic matrices of order $n$. The Birkhoff polytope graph $G(\Omega_n)$ is the skeleton of $\Omega_n$; it is the Cayley graph whose vertex set consists of the elements of the…

We show that if $G$ is a countable amenable group, then every stationary non-Gaussian symmetric $\alpha$-stable (S$\alpha$S) process indexed by $G$ is ergodic if and only if it is weakly-mixing, and it is ergodic if and only if its Rosinski…

Let $\mathcal{F}$ be a family of $k$-element subsets of $\{1,2,\ldots,n\}$. For $t\geq 1$, we say that $\mathcal{F}$ is {\it 3-wise $t$-intersecting} if $|F_1\cap F_2\cap F_3|\geq t$ for all $F_1,F_2,F_3\in \mathcal{F}$. In the present…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the proper subgroups of $G$ and in which two vertices $H$ and $K$ are joined by an edge if and only if $G=\langle H,K\rangle.$ We prove that if there exists a…

A graph $G(V,E)$ is a threshold graph if there exist non-negative reals $w_v, v \in V$ and $t$ such that for every $U \subseteq V$, $\sum_{v \in U} w_v\leq t$ if and only if $U$ is a stable set. The {\it threshold dimension} of a graph…