On the radius of spatial analyticity for the modified Kawahara equation on the line

First, by using linear and trilinear estimates in Bourgain type analytic and Gevrey spaces, the local well‐posedness of the Cauchy problem for the modified Kawahara equation on the line is established for analytic initial data that can be extended as holomorphic functions in a strip around the x‐axis. Next we use this local result and a Gevrey approximate conservation law to prove that global solutions exist. Furthermore, we obtain explicit lower bounds for the radius of spatial analyticity given by , where can be taken arbitrarily small and c is a positive constant.     

New families of graphs determined by their generalized spectrum

We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. All graphs constructed here satisfy a certain extremal divisibility condition for the determinant of their walk matrix.     

Weight enumerators of reducible cyclic codes and their dual codes

Let ${\mathbb{F}}_q$ be a finite field and $n$ a positive integer. In this paper, we find a new combinatorial method to determine weight enumerators of reducible cyclic codes and their dual codes of length $n$ over ${\mathbb{F}}_q$, which just generalize results of Zhu et al. (2015); especially, we also give the weight enumerator of a cyclic code, which is viewed as a partial Melas code. Furthermore, weight enumerators obtained in this paper are all in the form of power of a polynomial.     

Assortment planning for vertically differentiated products under a consider-then-choose model

Consider-then-choose models, borne out by empirical literature in marketing and psychology, note that customers follow a two-stage procedure to choose among alternatives. In this paper, we consider the assortment optimization problem of a retailer who manages a category of vertically differentiated products under customers’ consider-then-choose behavior. We characterize some structural results of the optimal assortment and find that the problem can be solved as the shortest path problem. Also, we develop an efficient algorithm to identify an optimal assortment.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.     

Nowhere-zero 3-flow of graphs with small independence number

Tutte’s $3$-flow conjecture states that every $4$-edge-connected graph admits a nowhere-zero $3$-flow. In this paper, we characterize all graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow. The characterization of $3$-flow verifies Tutte’s $3$-flow conjecture for graphs with independence number at most $4$ and with order at least $21$. In addition, we prove that every odd-$5$-edge-connected graph with independence number at most $3$ admits a nowhere-zero $3$-flow. To obtain these results, we introduce a new reduction method to handle odd wheels.     

Limit theorems for functionals of two independent Gaussian processes

Under certain mild conditions, some limit theorems for functionals of two independent Gaussian processes are obtained. The results apply to general Gaussian processes including fractional Brownian motion, sub-fractional Brownian motion and bi-fractional Brownian motion. A new and interesting phenomenon is that, in comparison with the results for fractional Brownian motion, extra randomness appears in the limiting distributions for Gaussian processes with nonstationary increments, say sub-fractional Brownian motion and bi-fractional Brownian. The results are obtained based on the method of moments, in which Fourier analysis, the chaining argument introduced in [11] and a pairing technique are employed.