English
Related papers

Related papers: On the Index of Diffie-Hellman Mapping

200 papers

This paper deals with the analytic continuation of holomorphic automorphic forms on a Lie group $G$. We prove that for any discrete subgroup $\Gamma$ of $G$ there always exists a non-trivial holomorphic automorphic form, i.e., there exists…

Representation Theory · Mathematics 2007-05-23 Dehbia Achab , Frank Betten , Bernhard Kroetz

If $\mathcal{G}$ is the group (under composition) of diffeomorphisms $f : {\bar{D}}(0;1) \rightarrow {\bar{D}}(0;1)$ of the closed unit disc ${\bar{D}}(0;1)$ which are the identity map $id : {\bar{D}}(0;1) \rightarrow {\bar{D}}(0;1)$ on the…

General Mathematics · Mathematics 2017-07-12 Nikolaos E. Sofronidis

Suppose $G$ is an amenable locally compact group. If $\{F_\gamma\} = \{F_\gamma\}_{\gamma\in\Gamma}$ is a F\o{}lner net for $G$, associate it with the net $\{\chi_{F_\gamma} / |F_\gamma|\} \subset L_1(G) \subset L_\infty^*(G)$. Thus, every…

Group Theory · Mathematics 2021-05-18 John Hopfensperger

An invariant random subgroup $H \leq G$ is a random closed subgroup whose law is invariant to conjugation by all elements of $G$. When $G$ is locally compact and second countable, we show that for every invariant random subgroup $H \leq G$…

Group Theory · Mathematics 2018-04-24 Ian Biringer , Omer Tamuz

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

Combinatorics · Mathematics 2019-07-31 Stephen Finbow , Christopher M. van Bommel

Recently Bacon, Childs and van Dam showed that the ``pretty good measurement'' (PGM) is optimal for the Hidden Subgroup Problem on the dihedral group D_n in the case where the hidden subgroup is chosen uniformly from the n involutions. We…

Quantum Physics · Physics 2007-05-23 Cristopher Moore , Alexander Russell

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. We examine the effects on…

Combinatorics · Mathematics 2016-05-24 Saeid Alikhani , Samaneh Soltani

Given a graph $\Gamma = (V, E)$ on $n$ vertices and $m$ edges, we define the Erd\H{o}s-R\'{e}nyi graph process with host $\Gamma$ as follows. A permutation $e_1,\dots,e_m$ of $E$ is chosen uniformly at random, and for $t\leq m$ we let…

Combinatorics · Mathematics 2018-11-09 Tony Johansson

We consider minimal maps $f:M\to N$ between Riemannian manifolds $(M,\mathrm{g}_M)$ and $(N,\mathrm{g}_N)$, where $M$ is compact and where the sectional curvatures satisfy $\sec_N\le \sigma\le \sec_M$ for some $\sigma>0$. Under certain…

Differential Geometry · Mathematics 2018-11-20 Felix Lubbe

We prove that if $\Sigma$ is a closed surface of genus at least 3 and $G$ is a split real semisimple Lie group of rank at least $3$ acting faithfully by isometries on a symmetric space $N$, then there exists a Hitchin representation…

Differential Geometry · Mathematics 2025-01-31 Nathaniel Sagman , Peter Smillie

Let $D$ be a strongly connected directed graph of order $n\geq 4$ which satisfies the following condition (*): for every pair of non-adjacent vertices $x, y$ with a common in-neighbour $d(x)+d(y)\geq 2n-1$ and $min \{ d(x), d(y)\}\geq n-1$.…

Combinatorics · Mathematics 2014-04-24 Samvel Kh. Darbinyan , Iskandar A. Karapetyan

For a finite group $G$, denote by $\alpha(G)$ the minimum number of vertices of any graph $\Gamma$ having $\text{Aut}(\Gamma)\cong G$. In this paper, we prove that $\alpha(G)\leq |G|$, with specified exceptions. The exceptions include four…

Group Theory · Mathematics 2022-03-25 Danai Deligeorgaki

Let $G$ be a linear algebraic group over a field $k$, and let $V$ be a $G$-module. Recall that the nullcone of $(G,V)$ is the set of points $v$ in $V$ with the property that $f(v)=0$ for every positive degree homogeneous invariant $f$ in…

Commutative Algebra · Mathematics 2014-02-27 Jonathan Elmer , Martin Kohls

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

Group Theory · Mathematics 2023-05-16 Bireswar Das , Dhara Thakkar

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Combinatorics · Mathematics 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

Group Theory · Mathematics 2014-01-03 Harald A. Helfgott , Akos Seress

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…

Group Theory · Mathematics 2014-10-01 Daniel Farley , Lucas Sabalka

The cycle space $\mathcal{C}(G)$ of a graph $G$ is defined as the linear space spanned by all cycles in $G$. For an integer $k\ge 3$, let $\mathcal{C}_k (G)$ denote the subspace of $\mathcal{C}(G)$ generated by the cycles of length exactly…

Combinatorics · Mathematics 2025-03-21 Xinmin Hou , Zhi Yin

We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we give an optimal answer in the following sense: let…

Combinatorics · Mathematics 2012-11-15 Daniela Kühn , John Lapinskas , Deryk Osthus

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

Group Theory · Mathematics 2019-09-17 Timothy C. Burness , Scott Harper
‹ Prev 1 4 5 6 7 8 10 Next ›