Unbounded norm convergence in Banach lattices

A net \((x_\alpha )\) in a vector lattice X is unbounded order convergent to \(x \in X\) if \(|x_\alpha - x| \wedge u\) converges to 0 in order for all \(u\in X_+\). This convergence has been investigated and applied in several recent papers by Gao et al. It may be viewed as a generalization of almost everywhere convergence to general vector lattices. In this paper, we study a variation of this convergence for Banach lattices. A net \((x_\alpha )\) in a Banach lattice X is unbounded norm convergent to x if Open image in new window for all \(u\in X_+\). We show that this convergence may be viewed as a generalization of convergence in measure. We also investigate its relationship with other convergences.     

$$C_0$$-semigroups associated with uniquely ergodic Kantorovich modifications of operators

We extend to the context of \(L^p\) spaces and \(C_0\)-semigroups of operators our previous results from Heilmann and Ra?a (Positivity 21:897–910, 2017.  https://doi.org/10.1007/s11117-016-0441-1), concerning the eigenstructure and iterates of uniquely ergodic Kantorovich modifications of linking operators.     

<Emphasis Type="Italic">um</Emphasis>-Topology in multi-normed vector lattices

Let \({\mathcal {M}}=\{m_\lambda \}_{\lambda \in \Lambda }\) be a separating family of lattice seminorms on a vector lattice X, then \((X,{\mathcal {M}})\) is called a multi-normed vector lattice (or MNVL). We write \(x_\alpha \xrightarrow {\mathrm {m}} x\) if \(m_\lambda (x_\alpha -x)\rightarrow 0\) for all \(\lambda \in \Lambda \). A net \(x_\alpha \) in an MNVL \(X=(X,{\mathcal {M}})\) is said to be unbounded m-convergent (or um-convergent) to x if \(|x_\alpha -x |\wedge u \xrightarrow {\mathrm {m}} 0\) for all \(u\in X_+\). um-Convergence generalizes un-convergence (Deng et al. in Positivity 21:963–974, 2017; Kandi? et al. in J Math Anal Appl 451:259–279, 2017) and uaw-convergence (Zabeti in Positivity, 2017. doi: 10.1007/s11117-017-0524-7), and specializes up-convergence (Ayd?n et al. in Unbounded p-convergence in lattice-normed vector lattices. arXiv:1609.05301) and \(u\tau \)-convergence (Dabboorasad et al. in \(u\tau \)-Convergence in locally solid vector lattices. arXiv:1706.02006v3). um-Convergence is always topological, whose corresponding topology is called unbounded m-topology (or um-topology). We show that, for an m-complete metrizable MNVL \((X,{\mathcal {M}})\), the um-topology is metrizable iff X has a countable topological orthogonal system. In terms of um-completeness, we present a characterization of MNVLs possessing both Lebesgue’s and Levi’s properties. Then, we characterize MNVLs possessing simultaneously the \(\sigma \)-Lebesgue and \(\sigma \)-Levi properties in terms of sequential um-completeness. Finally, we prove that every m-bounded and um-closed set is um-compact iff the space is atomic and has Lebesgue’s and Levi’s properties.     

A note “On <Emphasis Type="Italic">ss</Emphasis>-quasinormal or weakly <Emphasis Type="Italic">s</Emphasis>-permutably embedded subgroups of finite groups”

We point out some gaps in the paper (Monatsh Math doi: 10.1007/s00605-016-0877-1, 2016) by Kong and Guo, and give new brief proofs of the main results.     

Distributional Transformations Without Orthogonality Relations

Distributional transformations characterized by equations relating expectations of test functions weighted by a given biasing function on the original distribution to expectations of the test function’s higher derivatives with respect to the transformed distribution play a great role in Stein’s method and were, in great generality, first considered by Goldstein and Reinert (J Theoret Probab 18(1):237–260, 2005. doi: 10.1007/s10959-004-2602-6). We prove two abstract existence and uniqueness results for such distributional transformations, generalizing their \(X-P\)-bias transformation. On the one hand, we show how one can abandon previously necessary orthogonality relations by subtracting an explicitly known polynomial depending on the test function from the test function itself. On the other hand, we prove that for a given nonnegative integer m, it is possible to obtain the expectation of the m-th derivative of the test function with respect to the transformed distribution in the defining equation, even though the biasing function may have \(k<m\) sign changes, if these two numbers have the same parity. We explain how these results can be used to guarantee the existence of two different generalizations of the zero-bias transformation by Goldstein and Reinert (Ann Appl Probab 7(4):935–952, 1997. doi: 10.1214/aoap/1043862419). Further applications include the derivation of Stein-type characterizations without needing to solve any Stein equation and the presentation of a general framework for estimating the distance from the distribution of a given real random variable X to that of a random variable Z, whose distribution is characterized by some mth-order linear differential operator. We also explain the fact that, in general, the biased distribution depends on the choice of the sign change points, if these are ambiguous. This new phenomenon does not appear in the framework from Goldstein and Reinert (2005).     

SINGULAR CONFORMALLY INVARIANT TRILINEAR FORMS,I THE MULTIPLICITY ONE THEOREM

A normalized holomorphic family (depending on Open image in new window ∈ ?³) of conformally invariant trilinear forms on the sphere is studied. Its zero set Z is described. For Open image in new window ? Z, the multiplicity of the space of conformally invariant trilinear forms is shown to be 1.     

Convexity Inequalities for Positive Operators

We prove pointwise convexity (Jensen-type) inequalities of the form Open image in new window where F is a convex function defined on a convex subset of some Banach space X and T is the X-valued extension of a positive operator on some function space. Examples include the pointwise Hölder inequality T(fg) ≤ (Tf ^p )^{1/ p} (Tf ^q )^{1/ q} for a positive sublinear operator T. As applications we consider vector-valued conditional expectation and a ``real'' proof of the Riesz-Thorin theorem for positive operators.     

Serre’s modularity conjecture (I)

This paper is the first part of a work which proves Serre’s modularity conjecture. We first prove the cases \(p\not=2\) and odd conductor, and p=2 and weight 2, see Theorem 1.2, modulo Theorems 4.1 and 5.1. Theorems 4.1 and 5.1 are proven in the second part, see Khare and Wintenberger (Invent. Math., doi: 10.1007/s00222-009-0206-6, 2009). We then reduce the general case to a modularity statement for 2-adic lifts of modular mod 2 representations. This statement is now a theorem of Kisin (Invent. Math., doi: 10.1007/s00222-009-0207-5, 2009).     

Nonseparable closed vector subspaces of separable topological vector spaces

In 1983 P. Domański investigated the question: For which separable topological vector spaces E, does the separable space Open image in new window have a nonseparable closed vector subspace, where \(\hbox {c}\) is the cardinality of the continuum? He provided a partial answer, proving that every separable topological vector space whose completion is not q-minimal (in particular, every separable infinite-dimensional Banach space) E has this property. Using a result of S.A. Saxon, we show that for a separable locally convex space (lcs) E, the product space Open image in new window has a nonseparable closed vector subspace if and only if E does not have the weak topology. On the other hand, we prove that every metrizable vector subspace of the product of any number of separable Hausdorff lcs is separable. We show however that for the classical Michael line \(\mathbb M\) the space of all continuous real-valued functions on \(\mathbb M\) endowed with the pointwise convergence topology, \(C_p(\mathbb M)\) contains a nonseparable closed vector subspace while \(C_p(\mathbb M)\) is separable.     

Finite elements in some vector lattices of nonlinear operators

We study the collection of finite elements \(\Phi _{1}\big ({\mathcal {U}}(E,F)\big )\) in the vector lattice \({\mathcal {U}}(E,F)\) of orthogonally additive, order bounded (called abstract Uryson) operators between two vector lattices E and F, where F is Dedekind complete. In particular, for an atomic vector lattice E it is proved that for a finite element in \(\varphi \in {\mathcal {U}}(E,{\mathbb {R}})\) there is only a finite set of mutually disjoint atoms, where \(\varphi \) does not vanish and, for an atomless vector lattice the zero-vector is the only finite element in the band of \(\sigma \)-laterally continuous abstract Uryson functionals. We also describe the ideal \(\Phi _{1}\big ({\mathcal {U}}({\mathbb {R}}^n,{\mathbb {R}}^m)\big )\) for \(n,m\in {\mathbb {N}}\) and consider rank one operators to be finite elements in \({\mathcal {U}}(E,F)\).     

The Nevo–Zimmer intermediate factor theorem over local fields

The Nevo–Zimmer theorem classifies the possible intermediate G-factors Y in Open image in new window , where G is a higher rank semisimple Lie group, P a minimal parabolic and X an irreducible G-space with an invariant probability measure. An important corollary is the Stuck–Zimmer theorem, which states that a faithful irreducible action of a higher rank Kazhdan semisimple Lie group with an invariant probability measure is either transitive or free, up to a null set. We present a different proof of the first theorem, that allows us to extend these two well-known theorems to linear groups over arbitrary local fields.     

A BKR Operation for Events Occurring for Disjoint Reasons with High Probability

Given events A and B on a product space \(S={\prod }_{i = 1}^{n} S_{i}\), the set \(A \Box B\) consists of all vectors x = (x₁,…,x_n) ∈ S for which there exist disjoint coordinate subsets K and L of {1,…,n} such that given the coordinates x_i,i ∈ K one has that x ∈ A regardless of the values of x on the remaining coordinates, and likewise that x ∈ B given the coordinates x_j,j ∈ L. For a finite product of discrete spaces endowed with a product measure, the BKR inequality

$$ P(A \Box B) \le P(A)P(B) $$

(1)

was conjectured by van den Berg and Kesten (J Appl Probab 22:556–569, 1985) and proved by Reimer (Combin Probab Comput 9:27–32, 2000). In Goldstein and Rinott (J Theor Probab 20:275–293, 2007) inequality Eq. 1 was extended to general product probability spaces, replacing \(A \Box B\) by the set Open image in new window consisting of those outcomes x for which one can only assure with probability one that x ∈ A and x ∈ B based only on the revealed coordinates in K and L as above. A strengthening of the original BKR inequality Eq. 1 results, due to the fact that Open image in new window . In particular, it may be the case that \(A \Box B\) is empty, while Open image in new window is not. We propose the further extension Open image in new window depending on probability thresholds s and t, where Open image in new window is the special case where both s and t take the value one. The outcomes Open image in new window are those for which disjoint sets of coordinates K and L exist such that given the values of x on the revealed set of coordinates K, the probability that A occurs is at least s, and given the coordinates of x in L, the probability of B is at least t. We provide simple examples that illustrate the utility of these extensions.

     

EXOTIC SYMMETRIC SPACES OF HIGHER LEVEL: SPRINGER CORRESPONDENCE FOR COMPLEX REFLECTION GROUPS

Let G?=?GL(V) for a 2n-dimensional vector space V, and θ an involutive automorphism of G such that H?=?G ^θ ???Sp(V). Let Open image in new window be the set of unipotent elements g ∈ G such that θ(g)?=?g ^?1. For any integer r?≥?2, we consider the variety Open image in new window , on which H acts diagonally. Let Open image in new window be a complex reflection group. In this paper, generalizing the known result for r?=?2, we show that there exists a natural bijective correspondence (Springer correspondence) between the set of irreducible representations of W _n,r and a certain set of H-equivariant simple perverse sheaves on Open image in new window . We also consider a similar problem for Open image in new window , on which G acts diagonally, where G?=?GL(V) for a finite-dimensional vector space V.     

The linear complexity of a class of binary sequences with optimal autocorrelation

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding–Helleseth–Lam sequences (Des. Codes Cryptogr.,  https://doi.org/10.1007/s10623-017-0398-5), where p is an odd prime with \(p \equiv 1(\bmod 4)\). The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via a sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity.     

On Shalika germs

Let G be (the group of F-points of) a reductive group over a local field F satisfying the assumptions of Debacker (Ann Sci Ecole Norm Sup 35(4):391–422, 2002), sections 2.2, 3.2, 4.3. Let \(G_{{\text {reg}}}\subset G\) be the subset of regular elements. Let \(T\subset G\) be a maximal torus. We write \(T_{{\text {reg}}}=T\cap G_{{\text {reg}}}\). Let dg, dt be Haar measures on G and T. They define an invariant measure Open image in new window on Open image in new window . Let \(\mathcal {H}\) be the space of complex valued locally constant functions on G with compact support. For any \(f\in \mathcal {H}\), \(t\in T_{{\text {reg}}}\), we put \(I_t(f)=\int _{G/T}f(\dot{g}t\dot{g}^{-1})dg/dt\). Let \(\mathcal U\) be the set of conjugacy classes of unipotent elements in G. For any \(\Omega \in \mathcal U\) we fix an invariant measure \(\omega \) on \(\Omega \). It is well known—see, e.g., Rao (Ann Math 96:505-510, 1972)—that for any \(f\in \mathcal {H}\) the integral

$$\begin{aligned} I_\Omega (f)=\int _\Omega f\omega \end{aligned}$$

is absolutely convergent. Shalika (Ann Math 95:226–242, 1972) showed that there exist functions \(j_\Omega (t)\), \(\Omega \in \mathcal U\), on \(T\cap G_{{\text {reg}}}\), such that

$$\begin{aligned} I_t(f)=\sum _{\Omega \in \mathcal U}j_\Omega (t)I_\Omega (f) \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \quad \qquad \qquad \qquad \qquad \qquad ({\star }) \end{aligned}$$

for any \(f\in \mathcal {H}\), \(t\in T\) near to e, where the notion of near depends on f. For any \(r\ge 0\) we define an open \({\text {Ad}}(G)\)-invariant subset \(G_r\) of G, and a subspace \(\mathcal {H}_r\) of \(\mathcal {H}\), as in Debacker (Ann Sci Ecole Norm Sup 35(4):391–422, 2002). Here I show that for any \(f\in \mathcal {H}_r\) the equality \((\star )\) holds for all \(t\in T_{{\text {reg}}}\cap G_r\).

     

Asymptotic Normality of Some Graph Sequences

For a simple finite graph G denote by Open image in new window the number of ways of partitioning the vertex set of G into k non-empty independent sets (that is, into classes that span no edges of G). If \(E_n\) is the graph on n vertices with no edges then Open image in new window coincides with Open image in new window , the ordinary Stirling number of the second kind, and so we refer to Open image in new window as a graph Stirling number. Harper showed that the sequence of Stirling numbers of the second kind, and thus the graph Stirling sequence of \(E_n\), is asymptotically normal—essentially, as n grows, the histogram of Open image in new window , suitably normalized, approaches the density function of the standard normal distribution. In light of Harper’s result, it is natural to ask for which sequences \((G_n)_{n \ge 0}\) of graphs is there asymptotic normality of Open image in new window . Thanh and Galvin conjectured that if for each n, \(G_n\) is acyclic and has n vertices, then asymptotic normality occurs, and they gave a proof under the added condition that \(G_n\) has no more than \(o(\sqrt{n/\log n})\) components. Here we settle Thanh and Galvin’s conjecture in the affirmative, and significantly extend it, replacing “acyclic” in their conjecture with “co-chromatic with a quasi-threshold graph, and with negligible chromatic number”. Our proof combines old work of Navon and recent work of Engbers, Galvin and Hilyard on the normal order problem in the Weyl algebra, and work of Kahn on the matching polynomial of a graph.     

Toeplitz Operators with Uniformly Continuous Symbols

Let T _f be a Toeplitz operator on the Segal–Bargmann space or the standard weighted Bergman space over a bounded symmetric domain \({\Omega \subset {\bf C}^n}\) with possibly unbounded symbol f. Combining recent results in Bauer et al. (J. Funct. Anal. 259:57–78, 2010), Bauer et al. (J. reine angew. Math. doi: 10.1515/crelle-2015-0016), Issa (Integr. Equ. Oper. Theory 70:569–582, 2011) we show that in the case of uniformly continuous symbols f with respect to the Euclidean metric on C ⁿ and the Bergman metric on \({\Omega}\), respectively, the operator T _f is bounded if and only if f is bounded. Moreover, T _f is compact if and only if f vanishes at the boundary of \({\Omega.}\) This observation substantially extends a result in Coburn (Indiana Univ. Math. J. 23:433–439, 1973).     

Classification of affine symmetry groups of orbit polytopes

Let G be a finite group acting linearly on a vector space V. We consider the linear symmetry groups \({\text {GL}}(Gv)\) of orbits \(Gv\subseteq V\), where the linear symmetry group \({\text {GL}}(S)\) of a subset \(S\subseteq V\) is defined as the set of all linear maps of the linear span of S which permute S. We assume that V is the linear span of at least one orbit Gv. We define a set of generic points in V, which is Zariski open in V, and show that the groups \({\text {GL}}(Gv)\) for v generic are all isomorphic, and isomorphic to a subgroup of every symmetry group \({\text {GL}}(Gw)\) such that V is the linear span of Gw. If the underlying characteristic is zero, “isomorphic” can be replaced by “conjugate in \({\text {GL}}(V)\).” Moreover, in the characteristic zero case, we show how the character of G on V determines this generic symmetry group. We apply our theory to classify all affine symmetry groups of vertex-transitive polytopes, thereby answering a question of Babai (Geom Dedicata 6(3):331–337, 1977.  https://doi.org/10.1007/BF02429904).     

Narrow orthogonally additive operators

We generalize the notion of narrow operators to nonlinear maps on vector lattices. The main objects are orthogonally additive operators and, in particular, abstract Uryson operators. Most of the results extend known theorems obtained by O. Maslyuchenko, V. Mykhaylyuk and the second named author published in Positivity 13:459–495 (2009) for linear operators. For instance, we prove that every orthogonally additive laterally-to-norm continuous C-compact operator from an atomless Dedekind complete vector lattice to a Banach space is narrow. Another result asserts that the set \({\mathcal U}_{on}^{lc}(E,F)\) of all order narrow laterally continuous abstract Uryson operators is a band in the vector lattice of all laterally continuous abstract Uryson operators from an atomless vector lattice \(E\) with the principal projection property to a Dedekind complete vector lattice \(F\) . The band generated by the disjointness preserving laterally continuous abstract Uryson operators is the orthogonal complement to \({\mathcal U}_n^{lc}(E,F)\) .     

Constructions of cyclic constant dimension codes

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code sizes and the minimum distances are as large as possible. In this paper, we explore the ideas of constructing cyclic constant dimension codes proposed in Ben-Sasson et al. (IEEE Trans Inf Theory 62(3):1157–1165, 2016) and Otal and Özbudak (Des Codes Cryptogr, doi: 10.1007/s10623-016-0297-1, 2016) to obtain further results. Consequently, new code constructions are provided and several previously known results in [2] and [17] are extended.