On Templeman averages and variation functions

Let S be a countable semigroup acting in a measure-preserving fashion (g ? T _g ) on a measure space (Ω, A, µ). For a finite subset A of S, let |A| denote its cardinality. Let (A _k ) _k=1 ^∞ be a sequence of subsets of S satisfying conditions related to those in the ergodic theorem for semi-group actions of A. A. Tempelman. For A-measureable functions f on the measure space (Ω, A, μ) we form for k ≥ 1 the Templeman averages \(\pi _k (f)(x) = \left| {A_k } \right|^{ - 1} \sum\nolimits_{g \in A_k } {T_g f(x)}\) and set V _q f(x) = (Σ _k≥1|π _k+1(f)(x) ? π _k (f)(x)|q)^1/q when q ∈ (1, 2]. We show that there exists C > 0 such that for all f in L ¹(Ω, A, µ) we have µ({x ∈ Ω: V _q f(x) > λ}) ≤ C(∫_Ω | f | dµ/λ). Finally, some concrete examples are constructed.     

New bounds in Balog-Szemerédi-Gowers theorem

We prove, in particular, that every finite subset A of an abelian group with the additive energy κ|A|³ contains a set A′ such that |A′|?κ|A| and |A′ ? A′|?κ ^?4|A′|.     

Counting sets with small sumset and applications

We study the number of k-element sets A? {1,...,N} with |A+A| ≤ K|A| for some (fixed) K > 0. Improving results of the first author and of Alon, Balogh, Samotij and the second author, we determine this number up to a factor of 2 ^{o ( k )} N ^{o (1)} for most N and k. As a consequence of this and a further new result concerning the number of sets A??/N? with |A+A| ≤ c|A|², we deduce that the random Cayley graph on ?/N? with edge density ½ has no clique or independent set of size greater than (2+o(1)) log₂ N, asymptotically the same as for the Erd?s-Rényi random graph. This improves a result of the first author from 2003 in which a bound of 160log₂ N was obtained. As a second application, we show that if the elements of A ? ? are chosen at random, each with probability 1/2, then the probability that A+A misses exactly k elements of ? is equal to (2+O(1))^?k/2 as k → ∞.     

Turán-Type Results for Complete <Emphasis Type="Italic">h</Emphasis>-Partite Graphs in Comparability and Incomparability Graphs

We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let <₁,...,< _r be partial orders on P. Let G(P, <₁,...,< _r ) be the graph whose vertices are the elements of P, and x, y ∈ P are joined by an edge if x< _i y or y< _i x holds for some 1 ≤ i ≤ r. We show that if the edge density of G(P, <₁, ... , < _r ) is strictly larger than 1 ? 1/(2h ? 2) ^r , then P contains h disjoint sets A ₁, ... , A _h such that A ₁ < _j ... < _j A _h holds for some 1 ≤ j ≤ r, and |A ₁| = ... = |A _h | = Ω(|P|). Also, we show that if the complement of G(P, <) has edge density strictly larger than 1 ? 1/(3h ? 3), then P contains h disjoint sets A ₁, ... , A _h such that the elements of A _i are incomparable with the elements of A _j for 1 ≤ i < j ≤ h, and |A ₁| = ... = |A _h | = |P|^1?o(1). Finally, we prove that if the edge density of the complement of G(P, <₁, <₂) is α, then there are disjoint sets A, B ? P such that any element of A is incomparable with any element of B in both <₁ and <₂, and |A| = |B| > n ^1?γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.     

Coefficient estimates of negative powers and inverse coefficients for certain starlike functions

For ?1≤B<A≤1, let \(\mathcal {S}^{*}(A,B)\) denote the class of normalized analytic functions \(f(z)= z+{\sum }_{n=2}^{\infty }a_{n} z^{n}\) in |z|<1 which satisfy the subordination relation z f ^′(z)/f(z)?(1 + A z)/(1 + B z) and Σ^?(A,B) be the corresponding class of meromorphic functions in |z|>1. For \(f\in \mathcal {S}^{*}(A,B)\) and λ>0, we shall estimate the absolute value of the Taylor coefficients a _n (?λ,f) of the analytic function (f(z)/z)^?λ . Using this we shall determine the coefficient estimate for inverses of functions in the classes \(\mathcal {S}^{*}(A,B)\) and Σ^?(A,B).     

On multiple zeros of a partial theta function

We consider the partial theta function θ(q, x) := ∑_j=0^∞q^j(j+1)/2x^j, where x ∈ ? is a variable and q ∈ ?, 0 < |q| < 1, is a parameter. We show that, for any fixed q, if ζ is a multiple zero of the function θ(q, · ), then |ζ| ≤ 8¹¹.     

Intrinsic Ultracontractivity for Schrödinger Operators Based on Fractional Laplacians

We study the Feynman-Kac semigroup generated by the Schrödinger operator based on the fractional Laplacian ??(???Δ)^α/2???q in R ^d , for q?≥?0, α?∈?(0,2). We obtain sharp estimates of the first eigenfunction φ ₁ of the Schrödinger operator and conditions equivalent to intrinsic ultracontractivity of the Feynman-Kac semigroup. For potentials q such that lim_{|x| →?∞?} q(x)?=?∞ and comparable on unit balls we obtain that φ ₁(x) is comparable to (|x|?+?1)^???d???α (q(x)?+?1)^???1 and intrinsic ultracontractivity holds iff lim_{|x| →?∞?} q(x)/log|x|?=?∞. Proofs are based on uniform estimates of q-harmonic functions.     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

The Bergman kernel: Explicit formulas,deflation, Lu Qi-Keng problem and Jacobi polynomials

We investigate the Bergman kernel function for the intersection of two complex ellipsoids {(z,w ₁,w ₂) ∈ C ⁿ⁺²: |z ₁|²+...+|z _n |²+|w ₁| ^q < 1, |z ₁|²+...+|z _n |²+|w ₂| ^r < 1}. We also compute the kernel function for {(z ₁,w ₁,w ₂) ∈ C³: |z ₁|^2/n + |w ₁| ^q < 1, |z ₁|^2/n + |w ₂| ^r < 1} and show deflation type identity between these two domains. Moreover in the case that q = r = 2 we express the Bergman kernel in terms of the Jacobi polynomials. The explicit formulas of the Bergman kernel function for these domains enables us to investigate whether the Bergman kernel has zeros or not. This kind of problem is called a Lu Qi-Keng problem.     

Finite groups with an irreducible character of large degree

Let G be a finite group and d the degree of a complex irreducible character of G, then write |G| = d(d + e) where e is a nonnegative integer. We prove that |G| ≤ e⁴?e³ whenever e > 1. This bound is best possible and improves on several earlier related results.     

Note: A conjecture on partitions of groups

We conjecture that every infinite group G can be partitioned into countably many cells \(G = \bigcup\limits_{n \in \omega } {A_n }\) such that cov(A _n A _n ^?1 ) = |G| for each n ∈ ω Here cov(A) = min{|X|: X} ? G, G = X A}. We confirm this conjecture for each group of regular cardinality and for some groups (in particular, Abelian) of an arbitrary cardinality.     

On a result by geronimus

In 1935, Ya.L. Geronimus found the best integral approximation on the period [?π,π) of the function sin(n + 1)t ? 2q sin nt, q ∈ ?, by the subspace of trigonometric polynomials of degree at most n ? 1. This result is an integral analog of the known theorem by E.I. Zolotarev (1868). At present, there are several methods of proving this fact. We propose one more variant of the proof. In the case |q| ≥ 1, we apply the (2π/n)-periodization and the fact that the function | sin nt| is orthogonal to the harmonic cos t on the period. In the case |q| < 1, we use the duality relations for Chebyshev’s theorem (1859) on a rational function least deviating from zero on a closed interval with respect to the uniform metric.     

Short cubic exponential sums over primes

For y ≥ x ^4/5 L ^8B+151 (where L = log(xq) and B is an absolute constant), a nontrivial estimate is obtained for short cubic exponential sums over primes of the form S ₃(α; x, y) = ∑ _x?y<n≤x Λ(n)e(αn ³), where α = a/q + θ/q ², (a, q) = 1, L ^32(B+20) < q ≤ y ⁵ x ^?2 L ^?32(B+20), |θ| ≤ 1, Λ is the von Mangoldt function, and e(t) = e ^2πit.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

Hodge Star as Braided Fourier Transform

We study super-braided Hopf algebras Λ primitively generated by finite-dimensional right crossed (or Drinfeld-Radford-Yetter) modules Λ¹ over a Hopf algebra A which are quotients of the augmentation ideal A ⁺ as a crossed module by right multiplication and the adjoint coaction. Here super-bosonisation Open image in new window provides a bicovariant differential graded algebra on A. We introduce Λ _{m a x} providing the maximal prolongation, while the canonical braided-exterior algebra Λ _min = B _?(Λ¹) provides the Woronowicz exterior calculus. In this context we introduce a Hodge star operator ? by super-braided Fourier transform on B _?(Λ¹) and left and right interior products by braided partial derivatives. Our new approach to the Hodge star (a) differs from previous approaches in that it is canonically determined by the differential calculus and (b) differs on key examples, having order 3 in middle degree on k[S ₃] with its 3D calculus and obeying the q-Hecke relation ?² = 1 + (q ? q ^?1)? in middle degree on k _q [S L ₂] with its 4D calculus. Our work also provides a Hodge map on quantum plane calculi and a new starting point for calculi on coquasitriangular Hopf algebras A whereby any subcoalgebra \(\mathcal {L}\subseteq A\) defines a sub-braided Lie algebra and \({\Lambda }^{1}\subseteq \mathcal {L}^{*}\) provides the required data A ⁺ → Λ¹.     

The Number of <Emphasis Type="Italic">k</Emphasis>-Sumsets in an Abelian Group

Let G be an abelian group of order n. The sum of subsets A₁,...,A_k of G is defined as the collection of all sums of k elements from A₁,...,A_k; i.e., A₁ + A₂ + · · · + A_k = {a₁ + · · · + a_k | a₁ ∈ A₁,..., a_k ∈ A_k}. A subset representable as the sum of k subsets of G is a k-sumset. We consider the problem of the number of k-sumsets in an abelian group G. It is obvious that each subset A in G is a k-sumset since A is representable as A = A₁ + · · · + A_k, where A₁ = A and A₂ = · · · = A_k = {0}. Thus, the number of k-sumsets is equal to the number of all subsets of G. But, if we introduce a constraint on the size of the summands A₁,...,A_k then the number of k-sumsets becomes substantially smaller. A lower and upper asymptotic bounds of the number of k-sumsets in abelian groups are obtained provided that there exists a summand A_i such that |A_i| = n log^qn and |A₁ +· · ·+ A_i-1 + A_i+1 + · · ·+A_k| = n log^qn, where q = -1/8 and i ∈ {1,..., k}.     

Minimal logarithmic signatures for classical groups

The minimal logarithmic signature conjecture states that in any finite simple group there are subsets A _i , 1 ≤ i ≤ k such that the size |A _i | of each A _i is a prime or 4 and each element of the group has a unique expression as a product \({\prod_{i=1}^k x_i}\) of elements \({x_i \in A_i}\). The conjecture is known to be true for several families of simple groups. In this paper the conjecture is shown to be true for the groups \({\Omega^-_{2m}(q), \Omega^+_{2m}(q)}\), when q is even, by studying the action on suitable spreads in the corresponding projective spaces. It is also shown that the method can be used for the finite symplectic groups. The construction in fact gives cyclic minimal logarithmic signatures in which each A _i is of the form \({\{y_i^j \ |\ 0 \leq j < |A_i|\}}\) for some element y _i of order ≥ |A _i |.     

On Homogenization for Non-Self-Adjoint Periodic Elliptic Operators on an Infinite Cylinder

We consider an operator A^ε on L₂(\({\mathbb{R}^{{d_1}}} \times {T^{{d_2}}}\)) (d₁ is positive, while d₂ can be zero) given by A^ε = ?div A(ε^?1x₁,x₂)?, where A is periodic in the first variable and smooth in a sense in the second. We present approximations for (A^ε ? μ)^?1 and ?(A^ε ? μ)^?1 (with appropriate μ) in the operator norm when ε is small. We also provide estimates for the rates of approximation that are sharp with respect to the order.     

Improved bounds on the Hadwiger–Debrunner numbers

Let HD _d (p, q) denote the minimal size of a transversal that can always be guaranteed for a family of compact convex sets in Rd which satisfy the (p, q)-property (p ≥ q ≥ d + 1). In a celebrated proof of the Hadwiger–Debrunner conjecture, Alon and Kleitman proved that HD _d (p, q) exists for all p ≥ q ≥ d + 1. Specifically, they prove that \(H{D_d}(p,d + 1)is\tilde O({p^{{d^2} + d}})\).We present several improved bounds: (i) For any \(q \geqslant d + 1,H{D_d}(p,d) = \tilde O({p^{d(\frac{{q - 1}}{{q - d}})}})\). (ii) For q ≥ log p, \(H{D_d}(p,q) = \tilde O(p + {(p/q)^d})\). (iii) For every ? > 0 there exists a p₀ = p₀(?) such that for every p ≥ p₀ and for every \(q \geqslant {p^{\frac{{d - 1}}{d} + \in }}\) we have p ? q + 1 ≤ HD _d (p, q) ≤ p ? q + 2. The latter is the first near tight estimate of HD _d (p, q) for an extended range of values of (p, q) since the 1957 Hadwiger–Debrunner theorem.We also prove a (p, 2)-theorem for families in R² with union complexity below a specific quadratic bound.