English
Related papers

Related papers: Relative Definability of $n$-Generics

200 papers

Let K be a finitely generated field over Q, and A an abelian variety over K. Let <, > : A(K^a) x A(K^a) --> R be an arithmetic height pairing on A, where K^a is the algebric closure of K. For x_1,..., x_l \in A(K^a), we denote det(<x_i,…

Number Theory · Mathematics 2007-05-23 Atsushi Moriwaki

We prove the Singer conjecture for extended graph manifolds and pure complex-hyperbolic higher graph manifolds with residually finite fundamental groups. In real dimension three, where a result of Hempel ensures that the fundamental group…

Differential Geometry · Mathematics 2024-06-10 Luca F. Di Cerbo , Michael Hull

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

Group Theory · Mathematics 2009-11-04 Joao Araujo , J. D. Mitchell , Csaba Schneider

A packing of subsets $\mathcal S_1,..., \mathcal S_n$ in a group $G$ is a sequence $(g_1,...,g_n)$ such that $g_1\mathcal S_1,...,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is…

Combinatorics · Mathematics 2012-10-04 Roland Bacher

Given an infinite group $G$ and a subset $A$ of $G$ we let $\Delta(A) = {g \in G : |gA \cap A| =\infty}$ (this is sometimes called the combinatorial derivation of $A$). A subset $A$ of $G$ is called large if there exists a finite subset $F$…

Combinatorics · Mathematics 2014-09-30 Joshua Erde

Let $G$ be a finite group, and let $\mathrm{Irr}(G)$ denote the set of irreducible complex characters of $G$. An element $x$ of $G$ is said to be vanishing, if for some $\chi$ in $\mathrm{Irr}(G)$, we have $\chi(x)=0$. Also the element $x$…

Group Theory · Mathematics 2024-10-16 Mahdi Ebrahimi

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

Combinatorics · Mathematics 2009-06-11 Paul Monsky

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

Group Theory · Mathematics 2025-05-05 Martina Conte , Jan Moritz Petschick

We propose and discuss how basic notions (quadratic modules, positive elements, semialgebraic sets, Archimedean orderings) and results (Positivstellensaetze) from real algebraic geometry can be generalized to noncommutative $*$-algebras. A…

Operator Algebras · Mathematics 2007-09-25 Konrad Schmuedgen

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

Group Theory · Mathematics 2024-04-30 Cristina Acciarri , Pavel Shumyatsky

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind(S)$ of $S$ is defined to be the…

Number Theory · Mathematics 2014-01-31 Li-meng Xia

A group element is called a generalized torsion if a finite product of its conjugates is equal to the identity. We prove that in a nilpotent or FC-group, the generalized torsion elements are all torsion elements. Moreover, we compute the…

Group Theory · Mathematics 2025-08-28 Raimundo Bastos , Csaba Schneider , Danilo Silveira

We prove that for every compactum X and every integer $n \geq 2$ there are a compactum Z of $\dim \leq n$ and a surjective $UV^{n-1}$-map $r: Z \lo X$ having the property that: for every finitely generated abelian group G and every integer…

General Topology · Mathematics 2007-05-23 Michael Levin

We introduce a general notion of "genericity" for countable subsets of a space with Borel measure, and apply it to the set of vertices in the curve complex of a surface S, interpreted as subset of the space of projective measured…

Geometric Topology · Mathematics 2014-02-26 Martin Lustig , Yoav Moriah

Let $G_n$ be a simple graph on $V_n=\{v_1,\dots, v_n\}$. The Seidel matrix $S(G_n)$ of $G_n$ is the $n\times n$ matrix whose $(ij)$'th entry, for $i\neq j$ is $-1$ if $v_i\sim v_j$ and $1$ otherwise, and whose diagonal entries are $0$. We…

Combinatorics · Mathematics 2019-04-11 Douglas Rizzolo

Let $\Gamma$ be a countable abelian group. An (abstract) $\Gamma$-system $\mathrm{X}$ - that is, an (abstract) probability space equipped with an (abstract) probability-preserving action of $\Gamma$ - is said to be a Conze-Lesigne system if…

Dynamical Systems · Mathematics 2024-02-20 Asgar Jamneshan , Or Shalom , Terence Tao

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

Number Theory · Mathematics 2009-10-27 Mohamed El Bachraoui

If X is a non-empty subset of a finite group G, we denote by o(x) the order of x in G. Then we put The number o(X) is called the average order of X. Zapirain in 2011 , posed the following question: Let G be a finite (p-) group and N a…

Group Theory · Mathematics 2019-11-19 M. Zarrin

Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…

Logic · Mathematics 2019-07-02 Saeed Salehi , Payam Seraji

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki
‹ Prev 1 4 5 6 7 8 10 Next ›