中文
相关论文

相关论文: Optimal independent generating system for the cong…

200 篇论文

We prove that $\Gamma_0(2^n)$ ($n\ge2$) has a Farey sequence $\{e_i\}$ such that $e_i \le 2^{n-1}$ for all $e_i$. The above upper bound is optimal, and there exists a unique $j$ such that $e_j= 2^{n-1} $. For each $e_i$, there exists a…

数论 · 数学 2026-01-06 Nhat Minh Doan , Sang-hyun Kim , Mong Lung Lang , Ser Peow Tan

For a finite (not necessarily Abelian) group $(\Gamma,\cdot)$, let $n(\Gamma) \in \mathbb{N}$ denote the smallest positive integer $n$ such that for every labelling of the arcs of the complete digraph of order $n$ using elements from…

组合数学 · 数学 2024-07-16 Rutger Campbell , J. Pascal Gollin , Kevin Hendrey , Raphael Steiner

The congruence subgroup problem for a finitely generated group $\Gamma$ asks whether the map $\hat{Aut\left(\Gamma\right)}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(\Gamma\right)$? Here $\hat{X}$…

群论 · 数学 2019-02-05 David El-Chai Ben-Ezra

Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…

群论 · 数学 2007-08-22 E. V. Sokolov

We prove that II$_1$ factors $M$ have a unique (up to unitary conjugacy) cross-product type decomposition around ``core subfactors'' $N \subset M$ satisfying the property HT and a certain ``torsion freeness'' condition. In particular, this…

算子代数 · 数学 2007-05-23 Sorin Popa

For a finite Abelian group $(\Gamma,+)$, let $n(\Gamma)$ denote the smallest positive integer $n$ such that for each labelling of the arcs of the complete digraph of order $n$ using elements from $\Gamma$, there exists a directed cycle such…

组合数学 · 数学 2024-07-11 Micha Christoph , Charlotte Knierim , Anders Martinsson , Raphael Steiner

We demonstrate von Neumann algebra arising from an icc group $\Gamma$ in Chifan's, Ioana's, and Kida's class of poly-$\mathcal{C}_\text{rss} $, such as a poly-hyperbolic group with no amenable factors in its composition series, satisfies…

算子代数 · 数学 2018-02-27 Rolando de Santiago , Sujan Pant

The congruence subgroup problem for a finitely generated group $\Gamma$ asks whether $\widehat{Aut\left(\Gamma\right)}\to Aut(\hat{\Gamma})$ is injective, or more generally, what is its kernel $C\left(\Gamma\right)$? Here $\hat{X}$ denotes…

群论 · 数学 2017-01-02 David El-Chai Ben-Ezra , Alexander Lubotzky

Let $G = H_1 * ... * H_k * F_r$ be a torsion-free group and $\phi$ an automorphism of $G$ that preserves this free factor system. We show that when $\phi$ is fully irreducible and atoroidal relative to this free factor system, the mapping…

群论 · 数学 2025-07-02 François Dahmani , Suraj Krishna M S

We address two questions of Simon Thomas. First, we show that for any n>2 one can find a four generated free subgroup of SLn(Z) which is profinitely dense. More generally, we show that an arithmetic group \Gamma which admits the congruence…

群论 · 数学 2012-05-08 Menny Aka , Tsachik Gelander , Gregory A. Soifer

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

数论 · 数学 2026-01-01 Peter J. Cho , Robert J. Lemke Oliver , Asif Zaman

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…

组合数学 · 数学 2014-10-24 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Let f be a polynomial of degree n in ZZ[x_1,..,x_n], typically reducible but squarefree. From the hypersurface {f=0} one may construct a number of other subschemes {Y} by extracting prime components, taking intersections, taking unions, and…

代数几何 · 数学 2009-11-26 Allen Knutson

We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,\ldots,n\}$ whose size is in some interval $[k,l]$, $0\leq k\leq l\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by…

组合数学 · 数学 2018-02-16 Petr Gregor , Torsten Mütze

In this paper 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 $G$ on $n$…

组合数学 · 数学 2014-10-23 Béla Csaba , Daniela Kühn , Allan Lo , Deryk Osthus , Andrew Treglown

Let $c(G)$ denote the circumference of a graph $G$, i.e., the number of vertices in its longest cycle. For positive integers $n$ and $k$ with $n>k$, let $\varGamma(n;k)$ be the class of graphs of order $n$ with $c(G) = n-k$ such that every…

组合数学 · 数学 2026-02-24 Masaki Kashima , Kenta Ozeki , Leilei Zhang

We show that, for many choices of finite tuples of generators $X = (x_1, \dots , x_d)$ of a tracial von Neumann algebra $(M, \tau)$ satisfying certain decomposition properties (non-primeness, possessing a Cartan subalgebra, or property…

算子代数 · 数学 2025-11-18 Benjamin Major , Dimitri Shlyakhtenko

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

数论 · 数学 2015-06-26 P. Kurlberg , C. Pomerance

Let $\mathbb Z_n$ be the cyclic group of order $n \ge 3$ additively written. S. Savchev \& F. Chen (2007) proved that for each zero-sum free sequence $S = a_1 \bullet \dots \bullet a_t$ over $\mathbb Z_n$ of length $t > n/2$, there is an…

数论 · 数学 2018-11-12 Sávio Ribas

We show that if $\Gamma = \Gamma_1\times\dotsb\times \Gamma_n$ is a product of $n\geq 2$ non-elementary ICC hyperbolic groups then any discrete group $\Lambda$ which is $W^*$-equivalent to $\Gamma$ decomposes as a $k$-fold direct sum…

算子代数 · 数学 2018-02-27 Ionut Chifan , Rolando de Santiago , Thomas Sinclair
‹ 上一页 1 2 3 10 下一页 ›