相关论文: Large and symmetric: The Khukhro--Makarenko theore…

We prove some anologues for algebras of recent group-theoretic results (due to Khukhro, Klyachko, Makarenko, Milentyeva, and Shumyatsky) on large characteristic subgroups satisfying a given property.

We give a short proof and some strengthening of the Khukhro--Makarenko theorem that each group virtually satisfying an outer commutator identity contains a finite-index characteristic subgroup satisfying this identity. An estimate for the…

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]

In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…

If an outer (multilinear) commutator identity holds in a large subgroup of a group, then it holds also in a large characteristic subgroup. Similar assertions are valid for algebras and their ideals or subspaces. Varying the meaning of the…

In this paper we prove a generalized version of Hall's theorem for hypergraphs. More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1,…

In this paper we define a new algebraic object: the disguised-groups. We show the main properties of the disguised-groups and, as a consequence, we will see that disguised-groups coincide with regular semigroups. We prove many of the…

In this paper, we define an invariant, which we believe should be the substitute for total K-theory in the case when there is one distinguished ideal. Moreover, some diagrams relating the new groups to the ordinary K-groups with…

The Maclaurin inequalities for graphs are a broad generalisation of the classical theorems of Tur\'an and Zykov. In a nutshell they provide an asymptotically sharp answer to the following question: what is the maximum number of cliques of…

In this paper, we define a new structure analogous to group, called partial group. This structure concerns the partial stability by the composition inner law. We generalize the three isomorphism theorems for groups to partial groups.

We survey results related to the important Hossz\'u-Gluskin Theorem on $n$-ary groups adding also several new results and comments. The aim of this paper is to write all such results in uniform and compressive forms. Therefore some proofs…

We introduce a family of coefficients based on U-statistics that generalize the notion of correlation and explore their properties in the large dimensional multivariate case, showing that in the null case of uncorrelated variables, the…

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

The solution of Shareshian-Wachs conjecture by Brosnan-Chow and Guay-Paquet tied the graded chromatic symmetric functions on indifference graphs (or unit interval graphs) and the cohomology of regular semisimple Hessenberg varieties with…

The Harary-Sachs theorem for $k$-uniform hypergraphs equates the codegree-$d$ coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with $d$…

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Notions of higher Kazhdan property can be defined in terms of vanishing of unitary group cohomology in higher degrees. Garland's theorem for simple groups over non-archimedean fields provides the first examples of a higher Kazhdan property.…

This paper is purely expositional. The statement of the Kuratowski graph planarity criterion is simple and well-known. However, its classical proof is not easy. In this paper we present the Makarychev proof (with further simplifications by…

A theorem of Kaplansky asserts that a semigroup of matrices with entries from a field whose members all have singleton spectra is triangularizable. Indeed, Kaplansky's Theorem unifies well-known theorems of Kolchin and Levitzki on…