Roth-type theorems in finite groups

We prove Roth-type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemerédi.     

Maps on Ultrametric Spaces,Hensel's Lemma,and Differential Equations Over Valued Fields

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multidimensional Hensel's Lemma follow from our result. We give an easy proof that the latter holds in every henselian field. We also prove a basic infinite-dimensional Implicit Function Theorem. Further, we apply the criterion to deduce various versions of Hensel's Lemma for polynomials in several additive operators, and to give a criterion for the existence of integration and solutions of certain differential equations on spherically complete valued differential fields, for both valued D-fields in the sense of Scanlon, and differentially valued fields in the sense of Rosenlicht. We modify the approach so that it also covers logarithmic-exponential power series fields. Finally, we give a criterion for a sum of spherically complete subgroups of a valued abelian group to be spherically complete. This in turn can be used to determine elementary properties of power series fields in positive characteristic.     

IPr sets with polynomial weights and Szemerédi's theorem

In the mid 1980s H. Furstenberg and Y. Katznelson defined IPr sets in abelian groups as, roughly, sets consisting of all finite sums of r fixed elements. They obtained, via their powerful IP Szemerédi theorem for commuting groups of measure preserving transformations, many IPr set applications for the density Ramsey theory of abelian groups, including the striking result that, given e>0 and k∈N, there exists some r∈N such that for any IPr set R⊂Z and any E⊂Z with upper density >?, E contains a k-term arithmetic progression having common difference r∈R. Here, polynomial versions of these results are obtained as applications of a recently proved polynomial extension to the Furstenberg-Katznelson IP Szemerédi theorem.     

关于Morse引理的推广

Morse Lemma是奇点理论中一个极为重要的结论。[1]的作者称其文中的定理1和定理2是Morse Lemma的推广。为此我们愿就[1]中的几个问题与[1]的作者商榷。     

Noisy random graphs and their Laplacians

Spectra and representations of some special weighted graphs are investigated with weight matrices consisting of homogeneous blocks. It is proved that a random perturbation of the weight matrix or that of the weighted Laplacian with a “Wigner-noise” will not have an effect on the order of the protruding eigenvalues and the representatives of the vertices will unveil the underlying block-structure.Such random graphs adequately describe some biological and social networks, the vertices of which belong either to loosely connected strata or to clusters with homogeneous edge-densities between any two of them, like the structure guaranteed by the Regularity Lemma of Szemerédi.     

Extremal results in sparse pseudorandom graphs

Szemerédi's regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi's regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi's regularity lemma use an associated counting lemma. In order to prove extensions of these results which also apply to sparse graphs, it remained a well-known open problem to prove a counting lemma in sparse graphs.     

Ergodic Averages for Independent Polynomials and Applications

Szemerédi's theorem states that a set of integers withpositive upper density contains arbitrarily long arithmeticprogressions. Bergelson and Leibman generalized this, showingthat sets of integers with positive upper density contain arbitrarilylong polynomial configurations; Szemerédi's theorem correspondsto the linear case of the polynomial theorem. We focus on thecase farthest from the linear case, that of rationally independentpolynomials. We derive results in ergodic theory and in combinatoricsfor rationally independent polynomials, showing that their behaviordiffers sharply from the general situation.     

A note on near‐optimal coloring of shift hypergraphs

As shown in the original work on the Lovász Local Lemma due to Erd?s & Lovász (Infinite and Finite Sets, 1975), a basic application of the Local Lemma answers an infinitary coloring question of Strauss, showing that given any integer set S, the integers may be k‐colored so that S and all its translates meet every color. The quantitative bounds here were improved by Alon, Kriz & Nesetril (Studia Scientiarum Mathematicarum Hungarica, 1995). We obtain an asymptotically optimal bound in this note, using the technique of iteratively applying the Lovász Local Lemma in order to prune dependencies. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 48, 53–56, 2016     

A multilinear Phelps' Lemma

We prove a multilinear version of Phelps' Lemma: if the zero sets of multilinear forms of norm one are `close', then so are the multilinear forms.

     

Perverse equivalences and Brouéʼs conjecture

We give a new approach to the construction of derived equivalences between blocks of finite groups, based on perverse equivalences, in the setting of Broué?s abelian defect group conjecture. We provide in particular local and global perversity data describing the principal blocks and the derived equivalences for a number of finite simple groups with Sylow subgroups elementary abelian of order 9. We also examine extensions to automorphism groups in a general setting.     

Constructions Related to the Redei Property of Groups

We say that a finite abelian group does not have the Rédeiproperty if it can be expressed as a direct product of two ofits subsets such that both subsets contain the identity elementand both subsets span the whole group. It will be shown thatonly a small fraction of the finite abelian groups can havethe Rédei property. For groups of odd order an explicitlist of the possible exceptions is compiled.     

Jaffard-Ohm correspondence and Hochster duality

We study categorical aspects of the Jaffard–Ohm correspondencebetween abelian l-groups and Bézout domains and showthat this correspondence is close to a localization. For thispurpose, we establish a general extension theorem for valuationswith value group that is an abelian l-group. As an application,we prove Anderson's conjecture which refines the Jaffard–Ohmcorrespondence. We then extend the correspondence to sheaveson spectral spaces and show that the spectrum of a Bézoutdomain and the spectrum of its corresponding abelian l-groupprovide a concrete example for Hochster's duality of spectralspaces.     

The Dedekind-Mertens lemma and the contents of polynomials

We prove a sharpening of the Dedekind-Mertens Lemma relating the contents of two polynomials to the content of their product. We show that for a polynomial the integer in the Dedekind-Mertens Lemma may be replaced by the number of local generators of the content of . We also raise a question concerning the converse.

     

A variant of the hypergraph removal lemma

Recent work of Gowers [T. Gowers, A new proof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001) 465-588] and Nagle, Rödl, Schacht, and Skokan [B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures Algorithms, in press; V. Rödl, J. Skokan, Applications of the regularity lemma for uniform hypergraphs, preprint] has established a hypergraph removal lemma, which in turn implies some results of Szemerédi [E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975) 299-345], and Furstenberg and Katznelson [H. Furstenberg, Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Anal. Math. 34 (1978) 275-291] concerning one-dimensional and multidimensional arithmetic progressions, respectively. In this paper we shall give a self-contained proof of this hypergraph removal lemma. In fact we prove a slight strengthening of the result, which we will use in a subsequent paper [T. Tao, The Gaussian primes contain arbitrarily shaped constellations, preprint] to establish (among other things) infinitely many constellations of a prescribed shape in the Gaussian primes.     

A removal lemma for systems of linear equations over finite fields

We prove a removal lemma for systems of linear equations over finite fields: let X ₁, …, X _m be subsets of the finite field F _q and let A be a (k × m) matrix with coefficients in F _q ; if the linear system Ax = b has o(q ^m−k ) solutions with x _i ∈ X _i , then we can eliminate all these solutions by deleting o(q) elements from each X _i . This extends a result of Green [Geometric and Functional Analysis 15 (2) (2005), 340–376] for a single linear equation in abelian groups to systems of linear equations. In particular, we also obtain an analogous result for systems of equations over integers, a result conjectured by Green. Our proof uses the colored version of the hypergraph Removal Lemma.     

Factoring an Infinite Abelian Group by Subsets

By a theorem of L. Rédei if a finite abelian group is a direct product of its subsets such that each subset has a prime number of elements and contains the identity element of the group, then at least one of the factors must be a subgroup. The content of this paper is that this result holds for certain infinite abelian groups, too. Namely, for groups that are direct products of finitely many Prüferian groups and finite cyclic groups of prime power order, belonging to pairwise distinct primes.     

图象拓扑下的Ky Fan引理解集的本质连通区及其在对策论上的应用

本文在集值映射的图象拓扑意义下,证明了赋范线性空间中的Ky Fan引理的解集的本质连通区的存在性,由此得到一类对策的Nash平衡点集的本质连通区的存在性.     

Categorical abstract algebraic logic: The Diagram and the Reduction Operator Lemmas

The study of structure systems, an abstraction of the concept of first‐order structures, is continued. Structure systems have algebraic systems as their algebraic reducts and their relational component consists of a collection of relation systems on the underlying functors. An analog of the expansion of a first‐order structure by constants is presented. Furthermore, analogs of the Diagram Lemma and the Reduction Operator Lemma from the theory of equality‐free first‐order structures are provided in the framework of structure systems. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

HOMOCLINIC ORBITS FOR A CLASS OF HAMILTONIAN SYSTEMS WITH POTENTIALS CHANGING SIGN

In this paper, we prove the existence of nontrivial homoclinic orbits for a class of Hamiltonian systems with potential changing sign. We use Mountain Pass Lemma.     

整数环上的Farkas引理及其应用

将实数域上的Farkas引理进行推广,提出整数环上的Farkas引理.之后,利用整数环上的Farkas引理证明了一个有关Petri网结构有界性的判定定理.