A sufficient integral condition for local regularity of solutions to the surface growth model

The surface growth model, $u_t+u_{xxxx}+{?}_{xx}{u}_x^2=0$, is a one-dimensional fourth order equation, which shares a number of striking similarities with the three-dimensional incompressible Navier–Stokes equations, including the results regarding existence and uniqueness of solutions and the partial regularity theory. Here we show that a weak solution of this equation is smooth on a space-time cylinder Q if the Serrin condition $u_x\in L^{q^{\prime }}{L}^q(Q)$ is satisfied, where $q,q^{\prime }\in [1,\infty ]$ are such that either $1/q+4/q^{\prime }<1$ or $1/q+4/q^{\prime }=1$, $q^{\prime }<\infty$.     

Schatten properties,nuclearity and minimality of phase shift invariant spaces

We extend Feichtinger's minimality property on the smallest non-trivial time-frequency shift invariant Banach space, to the quasi-Banach case. Analogous properties are deduced for certain matrix spaces.We use these results to prove that the pseudo-differential operator $\mathrm{Op}(a)$ is a Schatten-q operator from $M^{\infty }$ to $M^p$ and r-nuclear operator from $M^{\infty }$ to $M^r$ when $a\in M^r$ for suitable p, q and r in $(0,\infty ]$.     

On a problem of Specker about Euclidean representations of finite graphs

Say that a graph $G$ is representable in ${\mathbb{R}}^n$ if there is a map $f$ from its vertex set into the Euclidean space ${\mathbb{R}}^n$ such that $6f\left(x\right)?f\left(x^{\prime }\right)6=6f\left(y\right)?f\left(y^{\prime }\right)6$ iff $\{x,x^{\prime }\}$ and$\{y,y^{\prime }\}$ are both edges or both non-edges in $G$. The purpose of this note is to present the proof of the following result, due to Einhorn and Schoenberg in Einhorn and Schoenberg (1966): if $G$ finite is neither complete nor independent, then it is representable in ${\mathbb{R}}^{\left|G\right|?2}$. A similar result also holds in the case of finite complete edge-colored graphs.     

Optimization of eigenvalue bounds for the independence and chromatic number of graph powers

The $k^{\text{th}}$ power of a graph $G=(V,E)$, $G^k$, is the graph whose vertex set is V and in which two distinct vertices are adjacent if and only if their distance in G is at most k. This article proves various eigenvalue bounds for the independence number and chromatic number of $G^k$ which purely depend on the spectrum of G, together with a method to optimize them. Our bounds for the k-independence number also work for its quantum counterpart, which is not known to be a computable parameter in general, thus justifying the use of integer programming to optimize them. Some of the bounds previously known in the literature follow as a corollary of our main results. Infinite families of graphs where the bounds are sharp are presented as well.     

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.     

Graph homomorphisms via vector colorings

In this paper we study the existence of homomorphisms $G\to H$ using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest real number $t\ge 2$ for which there exists an assignment of unit vectors $i\mapsto p_i$ to its vertices such that $〈p_i,p_j〉\le -1∕(t-1),$ when $i\sim j$. Our approach allows to reprove, without using the Erdős–Ko–Rado Theorem, that for $n>2r$ the Kneser graph $K_{n:r}$ and the $q$-Kneser graph $q{K}_{n:r}$ are cores, and furthermore, that for $n∕r=n^{\prime }∕r^{\prime }$ there exists a homomorphism $K_{n:r}\to K_{n^{\prime }:r^{\prime }}$ if and only if $n$ divides $n^{\prime }$. In terms of new applications, we show that the even-weight component of the distance $k$-graph of the $n$-cube $H_{n,k}$ is a core and also, that non-bipartite Taylor graphs are cores. Additionally, we give a necessary and sufficient condition for the existence of homomorphisms $H_{n,k}\to H_{n^{\prime },k^{\prime }}$ when $n∕k=n^{\prime }∕k^{\prime }$. Lastly, we show that if a 2-walk-regular graph (which is non-bipartite and not complete multipartite) has a unique optimal vector coloring, it is a core. Based on this sufficient condition we conducted a computational study on Ted Spence’s list of strongly regular graphs (http://www.maths.gla.ac.uk/ es/srgraphs.php) and found that at least 84% are cores.     

A generalization of lifting non-proper tropical intersections

Let X and $X^{\prime }$ be closed subschemes of an algebraic torus T over a non-archimedean field. We prove the rational equivalence as tropical cycles in the sense of [11, §2] between the tropicalization of the intersection product $X?X^{\prime }$ and the stable intersection $\mathrm{trop}(X)?\mathrm{trop}(X^{\prime })$, when restricted to (the inverse image under the tropicalization map of) a connected component C of $\mathrm{trop}(X)\cap \mathrm{trop}(X^{\prime })$. This requires possibly passing to a (partial) compactification of T with respect to a suitable fan. We define the compactified stable intersection in a toric tropical variety, and check that this definition is compatible with the intersection product in [11, §2]. As a result we get a numerical equivalence between $\stackrel{￣}{X}?{\stackrel{￣}{X}}^{\prime }{|}_{\stackrel{￣}{C}}$ and $\stackrel{￣}{\mathrm{trop}(X)?\mathrm{trop}(X^{\prime }){|}_C}$ via the compactified stable intersection, where the closures are taken inside the compactifications of T and ${\mathbb{R}}^n$. In particular, when X and $X^{\prime }$ have complementary codimensions, this equivalence generalizes [15, Theorem 6.4], in the sense that $X\cap X^{\prime }$ is allowed to be of positive dimension. Moreover, if $\stackrel{￣}{X}\cap {\stackrel{￣}{X}}^{\prime }$ has finitely many points which tropicalize to $\stackrel{￣}{C}$, we prove a similar equation as in [15, Theorem 6.4] when the ambient space is a reduced subscheme of T (instead of T itself).     

New results on permutation binomials of finite fields

After a brief review of the existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of ${\mathbb{F}}_{q^2}$ of the form $X^n(X^{d(q-1)}+a)$, where n and d are positive integers and $a\in {\mathbb{F}}_{q^2}^{⁎}$. Our contributions include two nonexistence results: (1) If q is even and sufficiently large and $a^{q+1}\ne 1$, then $X^n(X^{3(q-1)}+a)$ is not a PB of ${\mathbb{F}}_{q^2}$. (2) If $2\le d|q+1$, q is sufficiently large and $a^{q+1}\ne 1$, then $X^n(X^{d(q-1)}+a)$ is not a PB of ${\mathbb{F}}_{q^2}$ under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with $n=1$.     

On a conjecture of Fernando,Hou and Lappano concerning permutation polynomials over finite fields

Let ${\mathbb{F}}_q$ be the finite field with q elements and let $p=\text{char}{\mathbb{F}}_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots +X^{q^a-2}$ is a permutation polynomial of ${\mathbb{F}}_{q^e}$ if and only if (i) $a=2$ and $q=2$, or (ii) $a=1$ and $\text{gcd}(q-2,q^e-1)=1$. In the present paper we confirm this conjecture.     

Permutation trinomials over Fq3

We consider four classes of polynomials over the fields ${\mathbb{F}}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+A{x}^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+A{x}^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+A{x}^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+A{x}^q-Bx$, where $A,B\in {\mathbb{F}}_q$. We find sufficient conditions on the pairs $(A,B)$ for which these polynomials permute ${\mathbb{F}}_{q^3}$ and we give lower bounds on the number of such pairs.     

An improvement to the Hilton-Zhao vertex-splitting conjecture

For a simple graph G, denote by n, $\mathrm{\Delta }(G)$, and ${\chi }^{\prime }(G)$ its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if ${\chi }^{\prime }(G)=\mathrm{\Delta }(G)+1$ and ${\chi }^{\prime }(H)<{\chi }^{\prime }(G)$ for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let $G^{?}$ be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that $G^{?}$ must be edge-chromatic critical if $\mathrm{\Delta }(G)>n/3$, and they verified this when $\mathrm{\Delta }(G)\ge \frac{n}{2}(\sqrt{7}?1)\approx 0.82n$. In this paper, we prove it for $\mathrm{\Delta }(G)\ge 0.75n$.     

Perfect squares representing the number of rational points on elliptic curves over finite field extensions

Let q be a perfect power of a prime number p and $E({\mathbb{F}}_q)$ be an elliptic curve over ${\mathbb{F}}_q$ given by the equation $y^2=x^3+Ax+B$. For a positive integer n we denote by $\mathrm{\#}E({\mathbb{F}}_{q^n})$ the number of rational points on E (including infinity) over the extension ${\mathbb{F}}_{q^n}$. Under a mild technical condition, we show that the sequence ${\{\mathrm{\#}E({\mathbb{F}}_{q^n})\}}_{n>0}$ contains at most 10²⁰⁰ perfect squares. If the mild condition is not satisfied, then $\mathrm{\#}E({\mathbb{F}}_{q^n})$ is a perfect square for infinitely many n including all the multiples of 12. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range $q<50$ and $n\le 1000$.