Boolean Lattices: Ramsey Properties and Embeddings

A subposet Q ^′ of a poset Q is a copy of a poset P if there is a bijection f between elements of P and Q ^′ such that x ≤ y in P iff f(x) ≤ f(y) in Q. For posets P, P ^′, let the poset Ramsey number R(P, P ^′) be the smallest N such that no matter how the elements of the Boolean lattice Q _N are colored red and blue, there is a copy of P with all red elements or a copy of P ^′ with all blue elements. We provide some general bounds on R(P, P ^′) and focus on the situation when P and P ^′ are both Boolean lattices. In addition, we give asymptotically tight bounds for the number of copies of Q _n in Q _N and for a multicolor version of a poset Ramsey number.     

Planar Posets,Dimension, Breadth and the Number of Minimal Elements

In recent years, researchers have shown renewed interest in combinatorial properties of posets determined by geometric properties of its order diagram and topological properties of its cover graph. In most cases, the roots for the problems being studied today can be traced back to the 1970’s, and sometimes even earlier. In this paper, we study the problem of bounding the dimension of a planar poset in terms of the number of minimal elements, where the starting point is the 1977 theorem of Trotter and Moore asserting that the dimension of a planar poset with a single minimal element is at most 3. By carefully analyzing and then refining the details of this argument, we are able to show that the dimension of a planar poset with t minimal elements is at most 2t + 1. This bound is tight for t = 1 and t = 2. But for t ≥ 3, we are only able to show that there exist planar posets with t minimal elements having dimension t + 3. Our lower bound construction can be modified in ways that have immediate connections to the following challenging conjecture: For every d ≥ 2, there is an integer f(d) so that if P is a planar poset with dim(P) ≥ f(d), then P contains a standard example of dimension d. To date, the best known examples only showed that the function f, if it exists, satisfies f(d) ≥ d + 2. Here, we show that lim _d→∞ f(d)/d ≥ 2.     

Large Subposets with Small Dimension

Dorais asked for the maximum guaranteed size of a subposet with dimension at most d of an n-element poset. A lower bound of order \(\sqrt {n}\) was found by Goodwillie. We provide a sublinear upper bound for each d. For d = 2, our bound is n ^0.8295.     

Ergodic theorems with arithmetical weights

We prove that the divisor function d(n) counting the number of divisors of the integer n is a good weighting function for the pointwise ergodic theorem. For any measurable dynamical system (X, A, ν, τ) and any f ∈ L ^p (ν), p > 1, the limit

$$\mathop {\lim }\limits_{n \to \infty } \frac{1}{{\Sigma _{k = 1}^nd\left( k \right)}}\sum\limits_{k = 1}^n {d\left( k \right)f\left( {{\tau ^k}x} \right)} $$

exists ν-almost everywhere. The proof is based on Bourgain’s method, namely the circle method based on the shift model. Using more elementary ideas we also obtain similar results for other arithmetical functions, like the θ(n) function counting the number of squarefree divisors of n and the generalized Euler totient function J _s (n) = Σ _d|n d ^s μ(n/d), s > 0.

     

On vanishing coefficients of algebraic power series over fields of positive characteristic

Let K be a field of characteristic p>0 and let f(t ₁,…,t _d ) be a power series in d variables with coefficients in K that is algebraic over the field of multivariate rational functions K(t ₁,…,t _d ). We prove a generalization of both Derksen’s recent analogue of the Skolem–Mahler–Lech theorem in positive characteristic and a classical theorem of Christol, by showing that the set of indices (n ₁,…,n _d )∈? ^d for which the coefficient of \(t_{1}^{n_{1}}\cdots t_{d}^{n_{d}}\) in f(t ₁,…,t _d ) is zero is a p-automatic set. Applying this result to multivariate rational functions leads to interesting effective results concerning some Diophantine equations related to S-unit equations and more generally to the Mordell–Lang Theorem over fields of positive characteristic.     

On criteria of estimation of the errors of cubature formulas

The paper considers cubature formulas for calculating integrals of functions f(X), X = (x ₁, …, x _n ) which are defined on the n-dimensional unit hypercube K ⁿ = [0, 1] ⁿ and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α _j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ _{k = 1} ^N c _k f(X(k)) of cubature formulas (c _k > 0) as functions of the weights c _k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (r≤n) of the hypercube K ⁿ : |R(f)| ≤ \(\sum _{\alpha _j } \) G(α _j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX _r , where coefficients G(α _j ) are criteria which depend only on parameters c _k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c _k and X(k).     

When a smooth self-map of a semi-simple Lie group can realize the least number of periodic points

There are two algebraic lower bounds of the number of n-periodic points of a self-map f : M → M of a compact smooth manifold of dimension at least 3: NF_n(f) = min{#Fix(g~n); g ～ f; g continuous} and NJD_n(f) = min{#Fix(g~n); g ～ f; g smooth}. In general, NJD_n(f) may be much greater than NF_n(f). We show that for a self-map of a semi-simple Lie group, inducing the identity fundamental group homomorphism,the equality NF_n(f) = NJD_n(f) holds for all n ? all eigenvalues of a quotient cohomology homomorphism induced by f have moduli 1.     

Commutators with idempotent values on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R, f(x ₁, . . . , x _n ) a multilinear polynomial over C, ρ a nonzero right ideal of R and m > 1 a fixed integer such that

$$\qquad \left ([d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})]\right )^{m}=[d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})] $$

for all r ₁, . . . , r _n ∈ρ. Then either [f(x ₁,…,x _n ),x _n+1]x _n+2 is an identity for ρ or d(ρ)ρ = 0.

     

The program iteration method in a game problem of guidance

Let a sequence of d-dimensional vectors n _k = (n _k ¹ , n _k ² ,..., n _k ^d ) with positive integer coordinates satisfy the condition n _k ^j = α _j m _k +O(1), k ∈ ?, 1 ≤ j ≤ d, where α ₁ > 0,..., α _d > 0 and {m _k } _k=1 ^∞ is an increasing sequence of positive integers. Under some conditions on a function φ: [0,+∞) → [0,+∞), it is proved that, if the sequence of Fourier sums \({S_{{m_k}}}\) (g, x) converges almost everywhere for any function g ∈ φ(L)([0, 2π)), then, for any d ∈ ? and f ∈ φ(L)(ln⁺ L) ^d?1([0, 2π) ^d ), the sequence \({S_{{n_k}}}\) (f, x) of rectangular partial sums of the multiple trigonometric Fourier series of the function f and the corresponding sequences of partial sums of all conjugate series converge almost everywhere.     

A discrete version of Koldobsky’s slicing inequality

Let #K be a number of integer lattice points contained in a set K. In this paper we prove that for each d ∈ N there exists a constant C(d) depending on d only, such that for any origin-symmetric convex body K ? R ^d containing d linearly independent lattice points

$$\# K \leqslant C\left( d \right)\max \left( {\# \left( {K \cap H} \right)} \right)vo{l_d}{\left( K \right)^{\frac{{d - m}}{d}}},$$

where the maximum is taken over all m-dimensional subspaces of R ^d . We also prove that C(d) can be chosen asymptotically of order O(1) ^d d ^d?m . In particular, we have order O(1) ^d for hyperplane slices. Additionally, we show that if K is an unconditional convex body then C(d) can be chosen asymptotically of order O(d) ^d?m .

     

On the sum of the L1 influences of bounded functions

Let f: {-1, 1}ⁿ → [-1, 1] have degree d as a multilinear polynomial. It is well-known that the total influence of f is at most d. Aaronson and Ambainis asked whether the total L₁ influence of f can also be bounded as a function of d. Ba?kurs and Bavarian answered this question in the affirmative, providing a bound of O(d³) for general functions and O(d²) for homogeneous functions. We improve on their results by providing a bound of d² for general functions and O(d log d) for homogeneous functions. In addition, we prove a bound of d/(2p) + o(d) for monotone functions, and provide a matching example.     

Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices

Given a finite poset P, the intensively studied quantity La(n, P) denotes the largest size of a family of subsets of [n] not containing P as a weak subposet. Burcsi and Nagy (J. Graph Theory Appl. 1, 40–49 2013) proposed a double-chain method to get an upper bound \({\mathrm La}(n,P)\le \frac {1}{2}(|P|+h-2)\left (\begin {array}{c}n \\ \lfloor {n/2}\rfloor \end {array}\right )\) for any finite poset P of height h. This paper elaborates their double-chain method to obtain a new upper bound

$${\mathrm La}(n,P)\le \left( \frac{|P|+h-\alpha(G_{P})-2}{2}\right)\left( \begin{array}{c}n \\ \lfloor{\frac{n}{2}}\rfloor\end{array}\right) $$

for any graded poset P, where α(G _P ) denotes the independence number of an auxiliary graph defined in terms of P. This result enables us to find more posets which verify an important conjecture by Griggs and Lu (J. Comb. Theory (Ser. A) 119, 310–322, 2012).

     

Sets with even partition functions and 2-adic integers

For P ? \(\mathbb{F}_2 \)[z] with _P(0) = 1 and deg(_P) ≥ 1, let \(\mathcal{A}\) = \(\mathcal{A}\)(P) (cf. [4], [5], [13]) be the unique subset of ? such that Σ _n≥0 p(\(\mathcal{A}\), n)z ⁿ ≡ P(z) (mod 2), where p(\(\mathcal{A}\), n) is the number of partitions of n with parts in \(\mathcal{A}\). Let p be an odd prime and P ? \(\mathbb{F}_2 \)[z] be some irreducible polynomial of order p, i.e., p is the smallest positive integer such that P(z) divides 1 + z ^p in \(\mathbb{F}_2 \)[z]. In this paper, we prove that if m is an odd positive integer, the elements of \(\mathcal{A}\) = \(\mathcal{A}\)(P) of the form 2 ^k m are determined by the 2-adic expansion of some root of a polynomial with integer coefficients. This extends a result of F. Ben Saïd and J.-L. Nicolas [6] to all primes p.     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

Sharp Weak Type Inequalities for Fractional Integral Operators

Suppose that d≥1 is an integer, α∈(0,d) is a fixed parameter and let I _α be the fractional integral operator associated with d-dimensional Walsh-Fourier series on (0,1] ^d . Let p, q be arbitrary numbers satisfying the conditions 1≤p<d/α and 1/q=1/p?α/d. We determine the optimal constant K, which depends on α, d and p, such that for any f∈L ^p ((0,1] ^d ) we have

$$ ||I_{\alpha } f||_{L^{q,\infty }((0,1]^{d})}\leq K||f||_{L^{p}((0,1]^{d})}. $$

In fact, we shall prove this inequality in the more general context of probability spaces equipped with a regular tree-like structures. This allows us to obtain this result also for non-integer dimension. The proof exploits a certain modification of the so-called Bellman function method and appropriate interpolation-type arguments. We also present a sharp weighted weak-type bound for I _α , which can be regarded as a version of the Muckenhoupt-Wheeden conjecture for fractional integral operators.

     

Terwilliger algebras of wreath products of one-class association schemes

In this paper, we study the wreath product of one-class association schemes K _n =H(1,n) for n≥2. We show that the d-class association scheme \(K_{n_{1}}\wr K_{n_{2}}\wr \cdots \wr K_{n_{d}}\) formed by taking the wreath product of \(K_{n_{i}}\) (for n _i ≥2) has the triple-regularity property. Then based on this fact, we determine the structure of the Terwilliger algebra of \(K_{n_{1}}\wr K_{n_{2}}\wr \cdots \wr K_{n_{d}}\) by studying its irreducible modules. In particular, we show that every non-primary module of this algebra is 1-dimensional.     

Equicontinuity of maps on a dendrite with finite branch points

Let(T, d) be a dendrite with finite branch points and f be a continuous map from T to T. Denote byω(x,f) and P(f) the ω-limit set of x under f and the set of periodic points of,respectively. Write Ω(x,f) = {y| there exist a sequence of points x_k E T and a sequence of positive integers n_1 n_2 … such that lim_(k→∞)x_k=x and lim_(k→∞)f~(n_k)(x_k) =y}. In this paper, we show that the following statements are equivalent:(1) f is equicontinuous.(2) ω(x, f) = Ω(x,f) for any x∈T.(3) ∩_(n=1)~∞f~n(T) = P(f),and ω(x,f)is a periodic orbit for every x ∈ T and map h : x→ω(x,f)(x ET)is continuous.(4) Ω(x,f) is a periodic orbit for any x∈T.     

Forcing Posets with Large Dimension to Contain Large Standard Examples

The dimension of a poset P, denoted \(\dim (P)\), is the least positive integer d for which P is the intersection of d linear extensions of P. The maximum dimension of a poset P with \(|P|\le 2n+1\) is n, provided \(n\ge 2\), and this inequality is tight when P contains the standard example \(S_n\). However, there are posets with large dimension that do not contain the standard example \(S_2\). Moreover, for each fixed \(d\ge 2\), if P is a poset with \(|P|\le 2n+1\) and P does not contain the standard example \(S_d\), then \(\dim (P)=o(n)\). Also, for large n, there is a poset P with \(|P|=2n\) and \(\dim (P)\ge (1-o(1))n\) such that the largest d so that P contains the standard example \(S_d\) is o(n). In this paper, we will show that for every integer \(c\ge 1\), there is an integer \(f(c)=O(c^2)\) so that for large enough n, if P is a poset with \(|P|\le 2n+1\) and \(\dim (P)\ge n-c\), then P contains a standard example \(S_d\) with \(d\ge n-f(c)\). From below, we show that \(f(c)={\varOmega }(c^{4/3})\). On the other hand, we also prove an analogous result for fractional dimension, and in this setting f(c) is linear in c. Here the result is best possible up to the value of the multiplicative constant.     

Conjugacy classes in Möbius groups

Let \({\mathbb H^{n+1}}\) denote the n + 1-dimensional (real) hyperbolic space. Let \({\mathbb {S}^{n}}\) denote the conformal boundary of the hyperbolic space. The group of conformal diffeomorphisms of \({\mathbb {S}^{n}}\) is denoted by M(n). Let M _o (n) be its identity component which consists of all orientation-preserving elements in M(n). The conjugacy classification of isometries in M _o (n) depends on the conjugacy of T and T ^?1 in M _o (n). For an element T in M(n), T and T ^?1 are conjugate in M(n), but they may not be conjugate in M _o (n). In the literature, T is called real if T is conjugate in M _o (n) to T ^?1. In this paper we classify real elements in M _o (n). Let T be an element in M _o (n). Corresponding to T there is an associated element T _o in SO(n + 1). If the complex conjugate eigenvalues of T _o are given by \({\{e^{i\theta_j}, e^{-i\theta_j}\}, 0 < \theta_j \leq \pi, j=1,\ldots,k}\) , then {θ₁, . . . , θ _k } are called the rotation angles of T. If the rotation angles of T are distinct from each-other, then T is called a regular element. After classifying the real elements in M _o (n) we have parametrized the conjugacy classes of regular elements in M _o (n). In the parametrization, when T is not conjugate to T ^?1 , we have enlarged the group and have considered the conjugacy class of T in M(n). We prove that each such conjugacy class can be induced with a fibration structure.     

On random arithmetical functions. I

Let A _Q be the group of complex unit roots of an integer order \( Q \geqslant 2 \). Let \( {\xi_p}\left( {p \in \mathcal{P}} \right) \) be independent random variables distributed uniformly on the set A _Q , where \( \mathcal{P} \)is the set of primes. Let f be a completely multiplicative function defined on \( \mathcal{P} \) by f(p) = ξ _p . We investigate the summatory function of f(n) and the density of those n for which f(n + j) = κ _j (j = 0, …, t), where κ _j ∈ A _Q .