Central Sets Theorem along filters and some combinatorial consequences

The Central Sets Theorem was introduced by H. Furstenberg and then afterwards several mathematicians have provided various versions and extensions of this theorem. All of these theorems deal with central sets, and its origin from the algebra of Stone–?ech compactification of arbitrary semigroup, say $\beta S$. It can be proved that every closed subsemigroup of $\beta S$ is generated by a filter. We will show that, under some restrictions, one can derive the Central Sets Theorem for any closed subsemigroup of $\beta S$. We will derive this theorem using the corresponding filter and its algebra. Later we will also deal with how the notions of largeness along filters are preserved under some well behaved homomorphisms and give some consequences.     

Dilations of semigroups on von Neumann algebras and noncommutative Lp-spaces

We prove that any weak* continuous semigroup ${(T_t)}_{t?0}$ of factorizable Markov maps acting on a von Neumann algebra M equipped with a normal faithful state can be dilated by a group of Markov ?-automorphisms analogous to the case of a single factorizable Markov operator, which is an optimal result. We also give a version of this result for strongly continuous semigroups of operators acting on noncommutative ${\mathrm{L}}^p$-spaces and examples of semigroups to which the results of this paper can be applied. Our results imply the boundedness of the McIntosh's ${\mathrm{H}}^{\infty }$ functional calculus of the generators of these semigroups on the associated noncommutative ${\mathrm{L}}^p$-spaces generalising some previous work from Junge, Le Merdy and Xu. Finally, we also give concrete dilations for Poisson semigroups which are even new in the case of ${\mathbb{R}}^n$.     

Existence of strong minimizers for the Griffith static fracture model in dimension two

We consider the Griffith fracture model in two spatial dimensions, and prove existence of strong minimizers, with closed jump set and continuously differentiable deformation fields. One key ingredient, which is the object of the present paper, is a generalization to the vectorial situation of the decay estimate by De Giorgi, Carriero, and Leaci. This is based on replacing the coarea formula by a method to approximate $SB{D}^p$ functions with small jump set by Sobolev functions, and is restricted to two dimensions. The other two ingredients will appear in companion papers and consist respectively in regularity results for vectorial elliptic problems of the elasticity type and in a method to approximate in energy $GSB{D}^p$ functions by $SB{V}^p$ ones.     

On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting

We study multivariate approximation of periodic functions in the worst case setting with the error measured in the $L_{\infty }$ norm. We consider algorithms that use standard information ${\mathrm{\Lambda }}^{\mathrm{std}}$ consisting of function values or general linear information ${\mathrm{\Lambda }}^{\mathrm{all}}$ consisting of arbitrary continuous linear functionals. We investigate equivalences of various notions of algebraic and exponential tractability for ${\mathrm{\Lambda }}^{\mathrm{std}}$ and ${\mathrm{\Lambda }}^{\mathrm{all}}$ under the absolute or normalized error criterion, and show that the power of ${\mathrm{\Lambda }}^{\mathrm{std}}$ is the same as the one of ${\mathrm{\Lambda }}^{\mathrm{all}}$ for various notions of algebraic and exponential tractability. Our results can be applied to weighted Korobov spaces and Korobov spaces with exponential weights. This gives a special solution to Open Problem 145 as posed by Novak and Woźniakowski (2012) [40].     

Reducing the dichromatic number via cycle reversions in infinite digraphs

We prove the following conjecture of S. Thomassé: for every (potentially infinite) digraph $D$ it is possible to iteratively reverse directed cycles in such a way that the dichromatic number of the final reorientation $D^1$ of $D$ is at most two and each edge is reversed only finitely many times. In addition, we guarantee that in every strong component of $D^1$ all the local edge-connectivities are finite and any edge is reversed at most twice.     

Additive G-codes over Fq and their dualities

We define additive G-codes over finite fields. We prove that if C is an additive G-code over ${\mathbb{F}}_q$ with duality M then its dual with respect to this duality $C^M$ is an additive G-code. We prove that if M and $M^{\prime }$ are two dualities, then $C^M$ and $C^{M^{\prime }}$ are equivalent codes. Finally, we study the existence of self-dual codes for a variety of dualities and relate them to formally self-dual and linear self-dual codes.     

Low-energy points on the sphere and the real projective plane

We present a generalization of a family of points on ${\mathbb{S}}^2$, the Diamond ensemble, containing collections of N points on ${\mathbb{S}}^2$ with very small logarithmic energy for all $N\in \mathbb{N}$. We extend this construction to the real projective plane ${\mathbb{RP}}^2$ and we obtain upper and lower bounds with explicit constants for the Green and logarithmic energy on this last space.     

The cotype zeta function of Zd

We give an asymptotic formula for the number of sublattices $\Lambda \subseteq {\mathbb{Z}}^d$ of index at most $X$ for which ${\mathbb{Z}}^d/\Lambda$ has rank at most $m$, answering a question of Nguyen and Shparlinski. We compare this result to work of Stanley and Wang on Smith normal forms of random integral matrices and discuss connections to the Cohen–Lenstra heuristics. Our arguments are based on Petrogradsky’s formulas for the cotype zeta function of ${\mathbb{Z}}^d$, a multivariable generalization of the subgroup growth zeta function of ${\mathbb{Z}}^d$.     

On the symbol-pair distances of repeated-root constacyclic codes of length 2ps

Let $p$ be an odd prime, and $\lambda$ be a nonzero element of the finite field ${\mathbb{F}}_{p^m}$. The $\lambda$-constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are classified as the ideals of quotient ring $\frac{{\mathbb{F}}_{p^m}\left[x\right]}{〈x^{2p^s}?\lambda 〉}$ in terms of their generator polynomials. Based on these generator polynomials, the symbol-pair distances of all such $\lambda$-constacyclic codes of length $2p^s$ are obtained in this paper. As an application, all MDS symbol-pair constacyclic codes of length $2p^s$ over ${\mathbb{F}}_{p^m}$ are established, which produce many new MDS symbol-pair codes with good parameters.     

Complete permutation polynomials with the form (xpm−x+δ)s+axpm+bx over Fpn

In this paper, several classes of complete permutation polynomials with the form ${(x^{p^m}-x+\delta )}^s+a{x}^{p^m}+bx$ over ${\mathbb{F}}_{p^n}$ are proposed by the AGW criterion and determining the number of solutions of some equations. Our results also enrich constructions of known permutation polynomials.