Complete weight enumerators of a class of linear codes with two weights

In this paper, a class of $p$-ary linear codes with two weights is constructed by using the properties of cyclotomic classes of ${\mathbb{F}}_{p^2}^1$. The complete weight enumerators of these linear codes are also determined. In some cases, they are optimal and can be employed to obtain secret sharing schemes with interesting access structures and asymptotically optimal systematic authentication codes.     

Cauchy transform and Poisson’s equation

Let $u\in W^{1,p}\cap W_0^{1,p}$, $1?p?\infty$ be a solution of the Poisson equation $\Delta u=h$, $h\in L^p$, in the unit disk. We prove ${6?u6}_{L^p}?a_p{6h6}_{L^p}$ and ${6?u6}_{L^p}?b_p{6h6}_{L^p}$ with sharp constants $a_p$ and $b_p$, for $p=1$, $p=2$, and $p=\infty$. In addition, for $p>2$, with sharp constants $c_p$ and $C_p$, we show ${6?u6}_{L^{\infty }}?c_p{6h6}_{L^p}$ and ${6?u6}_{L^{\infty }}?C_p{6h6}_{L^p}$. We also give an extension to smooth Jordan domains.These problems are equivalent to determining a precise value of the $L^p$ norm of the Cauchy transform of Dirichlet’s problem.     

Lp- and Sp,qrB-discrepancy of the symmetrized van der Corput sequence and modified Hammersley point sets in arbitrary bases

We study the local discrepancy of a symmetrized version of the well-known van der Corput sequence and of modified two-dimensional Hammersley point sets in arbitrary base $b$. We give upper bounds on the norm of the local discrepancy in Besov spaces of dominating mixed smoothness $S_{p,q}^{r}B\left({[0,1)}^s\right)$, which will also give us bounds on the $L_p$-discrepancy. Our sequence and point sets will achieve the known optimal order for the $L_p$- and $S_{p,q}^{r}B$-discrepancy. The results in this paper generalize several previous results on $L_p$- and $S_{p,q}^{r}B$-discrepancy estimates and provide a sharp upper bound on the $S_{p,q}^{r}B$-discrepancy of one-dimensional sequences for $r>0$. We will use the $b$-adic Haar function system in the proofs.     

Conditional p-adic probability logic

In this paper we present the proof-theoretical approach to p-adic valued conditional probabilistic logics. We introduce two such logics denoted by ${\mathit{CPL}}_{{\mathbf{Z}}_{\mathbf{p}}}$ and ${\mathit{CPL}}_{{\mathbf{Q}}_{\mathbf{p}}}^{\mathit{fin}}$. Each of these logics extends classical propositional logic with a list of binary (conditional probability) operators. Formulas are interpreted in Kripke-like models that are based on p-adic probability spaces. Axiomatic systems with infinitary rules of inference are given and proved to be sound and strongly complete. The decidability of the satisfiability problem for each logic is proved.     

Random version of Dvoretzky’s theorem in ℓpn

We study the dependence on $\epsilon$ in the critical dimension $k(n,p,\epsilon )$ for which one can find random sections of the ${?}_p^n$-ball which are $(1+\epsilon )$-spherical. We give lower (and upper) estimates for $k(n,p,\epsilon )$ for all eligible values $p$ and $\epsilon$ as $n\to \infty$, which agree with the sharp estimates for the extreme values $p=1$ and $p=\infty$. Toward this end, we provide tight bounds for the Gaussian concentration of the ${?}_p$-norm.     

Sharpness of exponent bounds for SU(n)

The $p$-primary $v_1$-periodic homotopy groups of a topological space $X$, denoted by $v_1^{?1}{\pi }_1{\left(X\right)}_{\left(p\right)}$, are roughly the parts of the homotopy groups of $X$ localized at a prime $p$ which are detected by $K$-theory. We will use combinatorial number theory to determine, for $p$ an odd prime, the values of $n$ for which $v_1^{?1}{\pi }_{2(n?1)}{\left(SU\left(n\right)\right)}_{\left(p\right)}?\mathbb{Z}/p^{n?1+{\nu }_p\left(?\frac{n}{p}?!\right)}\text{.}$ As a corollary, we obtain new bounds for the $p$-exponent of ${\pi }_1\left(SU\left(n\right)\right)$.