相关论文: Relative Definability of $n$-Generics

We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of…

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

Let $G$ be a finite abelian group and let $K$ be an algebraically closed field of characteristic 0. We consider associative unital algebras $A$ over $K$ graded by $G$, that is $A=\oplus_{g\in G} A_g$, where the vector subspaces $A_g$…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

Let G be a linear algebraic group defined over a finite field F_q. We present several connections between the isogenies of G and the finite groups of rational points G(F_q^n). We show that an isogeny from G' to G over F_q gives rise to a…

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

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

We continue the study of $n$-dependent groups, fields and related structures, largely motivated by the conjecture that every $n$-dependent field is dependent. We provide evidence towards this conjecture by showing that every infinite…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

We study the generalized Hankel transform of the family of sequences satisfying the recurrence relation $a_{n+1} = \bigl(\alpha + \frac{\beta}{n+\gamma}\bigr) a_n$. We apply the obtained formula to several particular important sequences.…

For a finite group $G$ and a positive integer $n$, let $G(n)$ be the set of all elements in $G$ such that $x^{n}=1$. The groups $G$ and $H$ are said to be of the same (order) type if $G(n)=H(n)$, for all $n$. The main aim of this paper is…

We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb{L}_{\omega_1, \omega}$ sentence categorical on an end segment of…

Given a countable graph, we say a set $A$ of its vertices is \emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \emph{weakly universal} if it contains every finite graph as an induced subgraph. We show…

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

For a connected reductive algebraic group $G$ defined over a finite field $\mathbb F_q$, Kawanaka introduced the generalized Gelfand-Graev representations (GGGRs for short) of the finite group $G(\mathbb F_q)$ in the case where $q$ is a…

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…