Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3

In this paper, we construct a number of 4-GDDs where the group sizes are all congruent to 2 (mod 3). We also show that 4-GDDs of type $2^t{8}^s$ exist for all but a finite number of feasible values of s and t. The largest unknown case has type $2^4{8}^{18}$ and has 152 points. A number of 4-GDDs with at most 50 points are also constructed. These include one of type $4^8{1}^1{10}^1$, the last feasible type of the form $4^s{1}^t{n}^1$ with at most 50 points for which no 4-GDD was known.     

A model-theoretic characterization of constant-depth arithmetic circuits

We study the class ${\mathrm{\#}\text{AC}}^0$ of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. No model-theoretic characterization for arithmetic circuit classes is known so far. Inspired by Immerman's characterization of the Boolean circuit class ${\text{AC}}^0$, we remedy this situation and develop such a characterization of ${\mathrm{\#}\text{AC}}^0$. Our characterization can be interpreted as follows: Functions in ${\mathrm{\#}\text{AC}}^0$ are exactly those functions counting winning strategies in first-order model checking games. A consequence of our results is a new model-theoretic characterization of ${\text{TC}}^0$, the class of languages accepted by constant-depth polynomial-size majority circuits.     

Critical chirality in elliptic systems

We establish the regularity in 2 dimension of $L^2$ solutions to critical elliptic systems in divergence form involving chirality operators of finite $W^{1,2}$-energy.     

Virtual resolutions of points in P1×P1

We explore explicit virtual resolutions, as introduced by Berkesch, Erman, and Smith, for ideals of finite sets of points in ${\mathbb{P}}^1\times {\mathbb{P}}^1$. Specifically, we describe a virtual resolution for a sufficiently general set of points X in ${\mathbb{P}}^1\times {\mathbb{P}}^1$ that only depends on $|X|$. We also improve an existence result of Berkesch, Erman, and Smith in the special case of points in ${\mathbb{P}}^1\times {\mathbb{P}}^1$; more precisely, we give an effective bound for their construction that gives a virtual resolution of length two for any set of points in ${\mathbb{P}}^1\times {\mathbb{P}}^1$.     

Solution of the Navier–Stokes problem

A new a priori estimate for solutions to Navier–Stokes equations is derived. Uniqueness and existence of these solutions in ${\mathbb{R}}^3$ for all $t>0$ is proved in a class of solutions locally differentiable in time with values in $H^1\left({\mathbb{R}}^3\right)$, where $H^1\left({\mathbb{R}}^3\right)$ is the Sobolev space. By the solution a solution to an integral equation is understood. No smallness restrictions on the data are imposed.     

On the maximum number of minimum dominating sets in forests

Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number $\gamma$ has at most $2^{\gamma }$ minimum dominating sets. Bień gave a counterexample, which allows us to construct forests with domination number $\gamma$ and $2.0598^{\gamma }$ minimum dominating sets. We show that every forest with domination number $\gamma$ has at most $2.4606^{\gamma }$ minimum dominating sets, and that every tree with independence number $\alpha$ has at most $2^{\alpha -1}+1$ maximum independent sets.     

Complex surfaces of general type with K2 = 3,4 and pg = q = 0

We construct complex surfaces of general type with $p_g=0$ and $K^2=3,4$ as double covers of Enriques surfaces (called Keum–Naie surfaces) with a different way to the original constructions of Keum and Naie. As a result, we show that there is a $(?4)$-curve on the example with $K^2=3$, which might imply a special relation between Keum–Naie surfaces with $K^2=3$ and $K^2=4$.     

New families of flag-transitive linear spaces

In this paper, we construct new families of flag-transitive linear spaces with $q^{2n}$ points and $q^2$ points on each line that admit a one-dimensional affine automorphism group. We achieve this by building a natural connection with permutation polynomials of ${\mathbb{F}}_{q^2}$ of a particular form and following the scheme of Pauley and Bamberg in (2008) [14].     

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.     

Planar bipartite biregular degree sequences

A pair of sequences of natural numbers is called planar if there exists a simple, bipartite, planar graph for which the given sequences are the degree sequences of its parts. For a pair to be planar, the sums of the sequences have to be equal and Euler’s inequality must be satisfied. Pairs that verify these two necessary conditions are called admissible. We prove that a pair of constant sequences is planar if and only if it is admissible (such pairs can be easily listed) and is different from $\left(3^5\right|3^5)$ and $\left(3^{25}\right|5^{15})$.     

Low differentially uniform permutations from the Dobbertin APN function over F2n

Substitution boxes (S-boxes) play a central role in block ciphers. In substitution-permutation networks, the S-boxes should be permutation functions over ${\mathbb{F}}_{2^n}$ to realize the invertibility of the encryption. More importantly, the S-boxes should have low differential uniformity, high nonlinearity, and high algebraic degree in order to resist differential attacks, linear attacks, and higher order differential attacks, respectively. In this paper, we construct new classes of differentially 4 and 6-uniform permutations by modifying the image of the Dobbertin APN function $x^d$ with $d=2^{4k}+2^{3k}+2^{2k}+2^k-1$ over a subfield of ${\mathbb{F}}_{2^n}$. In addition, the algebraic degree and the lower bound of the nonlinearity of the constructed functions are given.