相关论文: A new characterization of Conrad's property for gr…
We study algebraic and topological properties of subsets of preorders on a group. In particular we study properties of the composition of two preorders, generalize a topological theorem of \cite{S} in the case of standard orders and show…
We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…
A left order on a magma (e.g., semigroup) is a total order of its elements that is left invariant under the magma operation. A natural topology can be introduced on the set of all left orders of an arbitrary magma. We prove that this…
We prove a few basic facts about the space of bi-invariant (or left-invariant) total order relations on a torsion-free, nonabelian, nilpotent group G. For instance, we show that the space of bi-invariant orders has no isolated points (so it…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
The famous Brauer-Fowler theorem states that the order of a finite simple group can be bounded in terms of the order of the centralizer of an involution. Using the classification of finite simple groups, we generalize this theorem and prove…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…
A Cayley object for a group G is a structure on which G acts regularly as a group of automorphisms. The main theorem asserts that a necessary and sufficient condition for the free abelian group G of rank m to have the generic n-tuple of…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
Starting from considering deeper relationship between conjugacy classes and irreducible representations of a finite group $G$, we find some quite simple $R-$matrice defined by using finite groups. This construction produces many sets (or…
Let K be an algebraically closed field of prime characteristic p, let N be a positive integer, let f be a self-map on the algebraic torus T=G_m^N defined over K, let V be a curve in T defined over K, and let x be a K-point of T. We show…
We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…
The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…
Inspired by Jaming's characterization of the Fourier transform on specific groups via the convolution property, we provide a novel approach which characterizes the Fourier transform on any locally compact abelian group. In particular, our…