Related papers: An integral weight realization theorem for subset …

Let $G$ be a connected and simply connected semisimple algebraic group over $\Bbb Q$ and let $\Gamma\subset G(\Bbb Q)$ be an arithmetic subgroup. Let $K_\infty\subset G(\Bbb R)$ be a maximal compact subgroup and let $d$ be the dimension of…

Let $G=(V,E)$ be a complete $n$-vertex graph with distinct positive edge weights. We prove that for $k\in\{1,2,...,n-1\}$, the set consisting of the edges of all minimum spanning trees (MSTs) over induced subgraphs of $G$ with $n-k+1$…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

This paper introduces a new topological space associated with a nonabelian free group $F_n$ of rank $n$ and a malnormal subgroup system $\mathcal{A}$ of $F_n$, called the space of currents relative to $\mathcal{A}$, which are…

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…

Let $(\mathcal{G},\Gamma)$ be an abstract graph of finite groups. If $\Gamma$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},\Gamma)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of…

An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…

The factorization number $F_2(G)$ of a finite group $G$ is the number of all possible factorizations of $G=HK$ as product of its subgroups $H$ and $K$, while the subgroup commutativity degree $\mathrm{sd}(G)$ of $G$ is the probability of…

Let $\Gamma < \mathrm{GL}_n(F)$ be a countable non-amenable linear group with a simple, center free Zariski closure, $\mathrm{Sub}(\Gamma)$ the space of all subgroups of $\Gamma$ with the, compact, metric, Chabauty topology. An invariant…

For two graphs $G_1$ and $G_2$, the size Ramsey number $\hat{r}(G_1,G_2)$ is the smallest positive integer $m$ for which there exists a graph $G$ of size $m$ such that for any red-blue edge-coloring of the graph $G$, $G$ contains either a…

It is known that a linear two-weight code $C$ over a finite field $\F_q$ corresponds both to a multiset in a projective space over $\F_q$ that meets every hyperplane in either $a$ or $b$ points for some integers $a<b$, and to a strongly…

We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…

A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…

A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

Following some recent work by Gross, we consider the partition function for QCD on a two dimensional torus and study its stringiness. We present strong evidence that the free energy corresponds to a sum over branched surfaces with small…

A group $G$ is said to be totally $2$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits for the induced…

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

Let $E \subset \mathbb{Z}^N$ be a set of positive upper Banach density and let $\Gamma < \operatorname{GL}_N(\mathbb{Z})$ be a finitely generated, strongly irreducible subgroup whose Zariski closure in $\operatorname{GL}_N(\mathbb{R})$ is a…

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…