Search

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

The preeminent target of present study is to reveal the speed characteristic of ongoing outbreak COVID-19 due to novel coronavirus. On January 2020, the novel coronavirus infection (COVID-19) detected in India, and the total statistic of cases continuously increased to 7 128 268 cases including 109 285 deceases to October 2020, where 860 601 cases are active in India. In this study, we use the Hermite wavelets basis in order to solve the COVID-19 model with time- arbitrary Caputo derivative. The discussed framework is based upon Hermite wavelets. The operational matrix incorporated with the collocation scheme is used in order to transform arbitrary-order problem into algebraic equations. The corrector scheme is also used for solving the COVID-19 model for distinct value of arbitrary order. Also, authors have investigated the various behaviors of the arbitrary-order COVID-19 system and procured developments are matched with exiting developments by various techniques. The various illustrations of susceptible, exposed, infected, and recovered individuals are given for its behaviors at the various value of fractional order. In addition, the proposed model has been also supported by some numerical simulations and wavelet-based results.

In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it does not contain a minor from two specific forbidden classes of graphs, all of cardinality $\aleph_1$. Unfortunately, their proof contains a gap, and their result is incorrect. In this paper, we construct a third type of obstruction: an $\aleph_1$-sized graph without a normal spanning tree that contains neither of the two types described by Diestel and Leader as a minor. Further, we show that any list of forbidden minors characterising the graphs with normal spanning trees must contain graphs of arbitrarily large cardinality., Comment: 9 pages. arXiv admin note: text overlap with arXiv:2005.02833

This paper studies the virtual $\chi_{-y}$-genera of Grothendieck's Quot schemes on surfaces, thus refining the calculations of the virtual Euler characteristics by Oprea-Pandharipande. We first prove a structural result expressing the equivariant virtual $\chi_{-y}$-genera of Quot schemes universally in terms of the Seiberg-Witten invariants. The formula is simpler for curve classes of Seiberg-Witten length $N$, which are defined in the paper. By way of application, we give complete answers in the following cases: (i) arbitrary surfaces for the zero curve class, (ii) relatively minimal elliptic surfaces for rational multiples of the fiber class, (iii) minimal surfaces of general type with $p_g>0$ for any curve classes. Furthermore, a blow up formula is obtained for curve classes of Seiberg-Witten length $N$. As a result of these calculations, we prove that the generating series of the virtual $\chi_{-y}$-genera are given by rational functions for all surfaces with $p_g>0$, addressing a conjecture of Oprea-Pandharipande. In addition, we study the reduced $\chi_{-y}$-genera for $K3$ surfaces and primitive curve classes with connections to the Kawai-Yoshioka formula., Comment: 48 pages. Reformulation of Theorem 1 for readability. Extra explanation for the mixed terms in section 2.2.3. Reference updates

Full-waveform inversion (FWI) is today a standard process for the inverse problem of seismic imaging. PDE-constrained optimization is used to determine unknown parameters in a wave equation that represent geophysical properties. The objective function measures the misfit between the observed data and the calculated synthetic data, and it has traditionally been the least-squares norm. In a sequence of papers, we introduced the Wasserstein metric from optimal transport as an alternative misfit function for mitigating the so-called cycle skipping, which is the trapping of the optimization process in local minima. In this paper, we first give a sharper theorem regarding the convexity of the Wasserstein metric as the objective function. We then focus on two new issues. One is the necessary normalization of turning seismic signals into probability measures such that the theory of optimal transport applies. The other, which is beyond cycle skipping, is the inversion for parameters below reflecting interfaces. For the first, we propose a class of normalizations and prove several favorable properties for this class. For the latter, we demonstrate that FWI using optimal transport can recover geophysical properties from domains where no seismic waves travel through. We finally illustrate these properties by the realistic application of imaging salt inclusions, which has been a significant challenge in exploration geophysics.

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower box dimension at least $n-0.5$ and we will also provide sharp examples. We also show here that such sets must be large in general in a precise sense which is also introduced in this paper., 9 pages. arXiv admin note: text overlap with arXiv:1711.06533

This paper is concerned with voting processes on graphs where each vertex holds one of two different opinions. In particular, we study the \emph{Best-of-two} and the \emph{Best-of-three}. Here at each synchronous and discrete time step, each vertex updates its opinion to match the majority among the opinions of two random neighbors and itself (the Best-of-two) or the opinions of three random neighbors (the Best-of-three). Previous studies have explored these processes on complete graphs and expander graphs, but we understand significantly less about their properties on graphs with more complicated structures. In this paper, we study the Best-of-two and the Best-of-three on the stochastic block model $G(2n,p,q)$, which is a random graph consisting of two distinct Erdős-Renyi graphs $G(n,p)$ joined by random edges with density $q\leq p$. We obtain two main results. First, if $p=\omega(\log n/n)$ and $r=q/p$ is a constant, we show that there is a phase transition in $r$ with threshold $r^*$ (specifically, $r^*=\sqrt{5}-2$ for the Best-of-two, and $r^*=1/7$ for the Best-of-three). If $r>r^*$, the process reaches consensus within $O(\log \log n+\log n/\log (np))$ steps for any initial opinion configuration with a bias of $\Omega(n)$. By contrast, if $r r^*$, we show that, for any initial opinion configuration, the process reaches consensus within $O(\log n)$ steps. To the best of our knowledge, this is the first result concerning multiple-choice voting for arbitrary initial opinion configurations on non-complete graphs.

This paper concerns the existence of transonic shock solutions to the 2-D steady compressible Euler system in an almost flat finite nozzle ( in the sense that it is a generic small perturbation of a flat one ), under physical boundary conditions proposed by Courant-Friedrichs in \cite{CourantFriedrichs1948}, in which the receiver pressure is prescribed at the exit of the nozzle. In the resulting free boundary problem, the location of the shock-front is one of the most desirable information one would like to determine. However, the location of the normal shock-front in a flat nozzle can be anywhere in the nozzle so that it provides little information on the possible location of the shock-front when the nozzle's boundary is perturbed. So one of the key difficulties in looking for transonic shock solutions is to determine the shock-front. To this end, a free boundary problem for the linearized Euler system will be proposed, whose solution will be taken as an initial approximation for the transonic shock solution. In this paper, a sufficient condition in terms of the geometry of the nozzle and the given exit pressure is derived which yields the existence of the solutions to the proposed free boundary problem. Once an initial approximation is obtained, a further nonlinear iteration could be constructed and proved to lead to a transonic shock solution., 53 pages

We establish a theory of $Q$-valued functions minimizing a suitable generalization of the Dirichlet integral. In a second paper the theory will be used to approximate efficiently area minimizing currents $\mathrm{mod}(p)$ when $p=2Q$, and to establish a first general partial regularity theorem for every $p$ in any dimension and codimension., 37 pages. First part of a two-papers work aimed at establishing a first general partial regularity theory for area minimizing currents modulo p, for any p and in any dimension and codimension. v3 is the final version, to appear on Comm. Pure Appl. Math

It is well known that when the geometry and/or coefficients allow stable trapped rays, the solution operator of the Helmholtz equation (a.k.a. the resolvent of the Laplacian) grows exponentially through a sequence of real frequencies tending to infinity. In this paper we show that, even in the presence of the strongest-possible trapping, if a set of frequencies of arbitrarily small measure is excluded, the Helmholtz solution operator grows at most polynomially as the frequency tends to infinity. One significant application of this result is in the convergence analysis of several numerical methods for solving the Helmholtz equation at high frequency that are based on a polynomial-growth assumption on the solution operator (e.g. $hp$-finite elements, $hp$-boundary elements, certain multiscale methods). The result of this paper shows that this assumption holds, even in the presence of the strongest-possible trapping, for most frequencies.

We survey results about Haar null subsets of (not necessarily locally compact) Polish groups. The aim of this paper is to collect the fundamental properties of the various possible definitions of Haar null sets, and also to review the techniques that may enable the reader to prove results in this area. We also present several recently introduced ideas, including the notion of Haar meager sets, which are closely analogous to Haar null sets. We prove some results in a more general setting than that of the papers where they were originally proved and prove some results for Haar meager sets which were already known for Haar null sets.

In this paper, we show how to use the framework of mod-Gaussian convergence in order to study the fluctuations of certain models of random graphs, of random permutations and of random integer partitions. We prove that, in these three frameworks, a generic homogeneous observable of a generic random model is mod-Gaussian under an appropriate renormalisation. This implies a central limit theorem with an extended zone of normality, a moderate deviation principle, an estimate of the speed of convergence, a local limit theorem and a concentration inequality. The universal asymptotic behavior of the observables of these models gives rise to a notion of mod-Gaussian moduli space., Comment: New version: the paper has been slightly shortened, and a few references were added. 52 pages, 13 figures

The theory of mixed multiplicities of filtrations by $m$-primary ideals in a ring is introduced in a recent paper by Cutkosky, Sarkar and Srinivasan. In this paper, we consider the positivity of mixed multiplicities of filtrations. We show that the mixed multiplicities of filtrations must be nonnegative real numbers and give examples to show that they could be zero or even irrational. When $R$ is analytically irreducible, and $\mathcal I(1),\ldots,\mathcal I(r)$ are filtrations of $R$ by $m_R$-primary ideals, we show that all of the mixed multiplicities $e_R(\mathcal I(1)^{[d_1]},\ldots,\mathcal I(r)^{[d_r]};R)$ are positive if and only if the ordinary multiplicities $e_R(\mathcal I(i);R)$ for $1\le i\le r$ are positive. We extend this to modules and prove a simple characterization of when the mixed multiplicities are positive or zero on a finitely generated module., 15 pages

[EN] In this paper, a novel technique is formed to obtain the solution of a fractional gas dynamics equation. Some reproducing kernel Hilbert spaces are defined. Reproducing kernel functions of these spaces have been found. Some numerical examples are shown to confirm the efficiency of the reproducing kernel Hilbert space method. The accurate pulchritude of the paper is arisen in its strong implementation of Caputo fractional order time derivative on the classical equations with the success of the highly accurate solutions by the series solutions. Reproducing kernel Hilbert space method is actually capable of reducing the size of the numerical work. Numerical results for different particular cases of the equations are given in the numerical section., This research was partially supported by Spanish Ministerio de Ciencia, Innovacion y Universidades PGC2018-095896-B-C22 and Generalitat Valenciana PROMETEO/2016/089.

Let R be a commutative noetherian ring. Lindo and Pande have recently posed the question asking when every ideal of R is isomorphic to some trace ideal of R. This paper studies this question and gives several answers. In particular, a complete answer is given in the case where R is local: it is proved in this paper that every ideal of R is isomorphic to a trace ideal if and only if R is an artinian Gorenstein ring, or a 1-dimensional hypersurface with multiplicity at most 2, or a unique factorization domain.

A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine the edge set. We study several aspects of this graph. Our motivation comes from two similarly constructed, well-studied random graphs: $k$-out graphs and preferential attachment graphs. In this paper, we find the asymptotic distribution of its minimum degree and connectivity, and study the expansion properties of $G_{n,k}$ to show that the conductance of $G_{n,k}$ is of order $(\log n)^{-1}$. We also study the bootstrap percolation on $G_{n,k}$, where, each vertex is either initially infected with probability $p$, independently of others, or gets infected later as a result of having $r$ infected neighbors at some point. We show that, for $2\le r\le k-1$, if $p\ll (\log n)^{-r/(r-1)}$, then, with probability approaching 1, the process ends before all vertices get infected. On the other hand, if $p\ge \omega(\log n)^{-r/(r-1)}$, where $\omega$ is a certain very slowly growing function, then all the vertices get infected with probability approaching 1.

The first goal of this paper is to prove multiple asymptotic results for a time-discrete and space-continuous polymer model of a random walk in a random potential. These results include: existence of deterministic free energy density in the infinite volume limit for every fixed asymptotic slope; concentration inequalities for free energy implying a bound on its fluctuation exponent; straightness estimates implying a bound on the transversal fluctuation exponent. The culmination of this program is almost sure existence and uniqueness of polymer measures on one-sided infinite paths with given endpoint and slope, and interpretation of these infinite-volume Gibbs measures as thermodynamic limits. Moreover, we prove that marginals of polymer measures with the same slope and different endpoints are asymptotic to each other. The second goal of the paper is to develop ergodic theory of the Burgers equation with positive viscosity and random kick forcing on the real line without any compactness assumptions. Namely, we prove a One Force -- One Solution principle, using the infinite volume polymer measures to construct a family of stationary global solutions for this system, and proving that each of those solutions is a one-point pullback attractor on the initial conditions with the same spatial average. This provides a natural extension of the same program realized for the inviscid Burgers equation with the help of action minimizers that can be viewed as zero temperature limits of polymer measures., Comment: 67 pages. This is an extension of the ergodic program for the Burgers equation in arXiv:1205.6721 and arXiv:1406.5660 to the positive viscosity case. Minor clarifications and additions to bibliography in this version

This paper develops an abstract theory for subdifferential operators to give existence and uniqueness of solutions to the initial-boundary problem (P) for the nonlinear diffusion equation in an unbounded domain $\Omega\subset\mathbb{R}^N$ ($N\in{\mathbb N}$), written as \[ \frac{\partial u}{\partial t} + (-\Delta+1)\beta(u) = g \quad \mbox{in}\ \Omega\times(0, T), \] which represents the porous media, the fast diffusion equations, etc., where $\beta$ is a single-valued maximal monotone function on $\mathbb{R}$, and $T>0$. Existence and uniqueness for (P) were directly proved under a growth condition for $\beta$ even though the Stefan problem was excluded from examples of (P). This paper completely removes the growth condition for $\beta$ by confirming Cauchy's criterion for solutions of the following approximate problem (P)$_{\varepsilon}$ with approximate parameter $\varepsilon>0$: \[ \frac{\partial u_{\varepsilon}}{\partial t} + (-\Delta+1)(\varepsilon(-\Delta+1)u_{\varepsilon} + \beta(u_{\varepsilon}) + \pi_{\varepsilon}(u_{\varepsilon})) = g \quad \mbox{in}\ \Omega\times(0, T), \] which is called the Cahn--Hilliard system, even if $\Omega \subset \mathbb{R}^N$ ($N \in \mathbb{N}$) is an unbounded domain. Moreover, it can be seen that the Stefan problem is covered in the framework of this paper.

The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or susceptible. At each round every susceptible vertex which has at least $r\geq 2$ infected neighbours becomes infected and remains so forever. Assume that initially $a(t)$ vertices are randomly infected, where $t$ is the total number of vertices of the graph. Suppose also that $r < m$, where $2m$ is the average degree. We determine a critical function $a_c(t)$ such that when $a(t) \gg a_c(t)$, complete infection occurs with high probability as $t \rightarrow \infty$, but when $a(t) \ll a_c (t)$, then with high probability the process evolves only for a bounded number of rounds and the final set of infected vertices is asymptotically equal to $a(t)$., This paper is significantly different to the previous version

A Borel set B⊂Rn is visible from x∈Rn, if the radial projection of B with base point x has positive Hn−1 measure. I prove that if dimB>n−1, then B is visible from every point x∈Rn∖E, where E is an exceptional set with dimension dimE⩽2(n−1)−dimB. This is the sharp bound for all n⩾2. Many parts of the proof were already contained in a recent previous paper by P. Mattila and the author, where a weaker bound for dimE was derived as a corollary from a certain slicing theorem. Here, no improvement to the slicing result is obtained; in brief, the main observation of the present paper is that the proof method gives the optimal result, when applied directly to the visibility problem.

In this paper, we study time-asymptotic propagation phenomena for a class of dispersive equations on the line by exploiting precise estimates of oscillatory integrals. We propose first an extension of the van der Corput Lemma to the case of phases which may have a stationary point of real order and amplitudes allowed to have an integrable singular point. The resulting estimates provide optimal decay rates which show explicitly the influence of these two particular points. Then we apply these abstract results to solution formulas of a class of dispersive equations on the line defined by Fourier multipliers. Under the hypothesis that the Fourier transform of the initial data has a compact support or an integrable singular point, we derive uniform estimates of the solutions in space-time cones, describing their motions when the time tends to infinity. The method permits also to show that symbols having a restricted growth at infinity may influence the dispersion of the solutions: we prove the existence of a cone, depending only on the symbol, in which the solution is time-asymptotically localized. This corresponds to an asymptotic version of the notion of causality for initial data without compact support., Comment: This paper is an improved and extended version of arXiv:1507.00883. Moreover this second version contains supplementary information on wave packets to motivate our results and comments on the applicability of our method to the study of certain hyperbolic equations

This paper deals with an adaptation of the Poincare-Lindstedt method for the determination of periodic orbits in three-dimensional nonlinear differential systems. We describe here a general symbolic algorithm to implement the method and apply it to compute periodic solutions in a three-dimensional Lotka-Volterra system modeling a chain food interaction. The sufficient conditions to make secular terms disappear from the approximate series solution are given in the paper.

The purpose of this document is to connect two maps related to certain graphs embedded in the disc. The first is Postnikov's boundary measurement map, which combines partition functions of matchings in the graph into a map from an algebraic torus to an open positroid variety in a Grassmannian. The second is a rational map from the open positroid variety to an algebraic torus, given by certain Plucker coordinates which are expected to be a cluster in a cluster structure. This paper clarifies the relationship between these two maps, which has been ambiguous since they were introduced by Postnikov in 2001. The missing ingredient supplied by this paper is a twist automorphism of the open positroid variety, which takes the target of the boundary measurement map to the domain of the (conjectural) cluster. Among other applications, this provides an inverse to the boundary measurement map, as well as Laurent formulas for twists of Plucker coordinates.

In this paper, we examine embeddings of alternating and symmetric groups into almost simple groups of exceptional type. In particular, we prove that if the alternating or symmetric group has degree equal to 5, or 8 or more, then it cannot appear as the maximal subgroup of any almost simple exceptional group of Lie type. Furthermore, in the remaining open cases of degrees 6 and 7 we give considerable information about the possible embeddings. Note that no maximal alternating or symmetric subgroups are known in the remaining cases. This is the first in a sequence of papers aiming to substantially improve the state of knowledge about the maximal subgroups of exceptional groups of Lie type.

This paper studies a higher dimensional generalization of Frieze's $\zeta(3)$-limit theorem in the Erd\"os-R\'enyi graph process. Frieze's theorem states that the expected weight of the minimum spanning tree converges to $\zeta(3)$ as the number of vertices goes to infinity. In this paper, we study the $d$-Linial-Meshulam process as a model for random simplicial complexes, where $d=1$ corresponds to the Erd\"os-R\'enyi graph process. First, we define spanning acycles as a higher dimensional analogue of spanning trees, and connect its minimum weight to persistent homology. Then, our main result shows that the expected weight of the minimum spanning acycle behaves in $O(n^{d-1})$., Comment: 24 pages

The k-core, defined as the maximal subgraph of minimum degree at least k, of the random graph G(n,p) has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [J Combin Theory Ser B 67 (1996), 111–151] determined the threshold dk for the appearance of an extensive k-core. The aim of the present paper is to describe how the k-core is “embedded” into the random graph in the following sense. Let k≥3 and fix d=np>dk. Colour each vertex that belongs to the k-core of G(n,p) in black and all remaining vertices in white. Here we derive a multi-type branching process that describes the local structure of this coloured random object as n tends to infinity. This generalises prior results on, e.g., the internal structure of the k-core. In the physics literature it was suggested to characterize the core by means of a message passing algorithm called Warning Propagation. Ibrahimi, Kanoria, Kraning and Montanari [Ann Appl Probab 25 (2015), 2743–2808] used this characterization to describe the 2-core of random hypergraphs. To derive our main result we use a similar approach. A key observation is that a bounded number of iterations of this algorithm is enough to give a good approximation of the k-core. Based on this the study of the k-core reduces to the analysis of Warning Propagation on a suitable Galton-Watson tree. © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 00, 000–000, 2017

In this paper we prove a sharp distortion property of the Cassinian metric under Mobius transformations of a punctured ball onto another punctured ball. The paper also deals with discussion on local convexity properties of the Cassinian metric balls in proper subdomains of Rn. Inclusion properties of the Cassinian metric balls with other hyperbolic-type metric balls are also investigated. In particular, several conjectures are also stated in response to sharpness of the inclusion relations.

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are i.i.d. copies of some random variable $\xi$. These new points form a new (smaller) polygon. By repeatedly implementing this procedure we obtain a sequence of random polygons. The aim of this paper is to show that under very mild non-degenerateness conditions on $\xi$, the shapes of these polygons eventually become "flat" The convergence rate to flatness is also investigated; in particular, in the case of triangles ($d=3$), we show how to calculate the exact value of the rate of convergence, connected to Lyapunov exponents. Using the theory of products of random matrices our paper greatly generalizes the results of Volkov (2013) which are achieved mostly by using ad hoc methods., Comment: 35 pages, 2 figures

Staircase tableaux are combinatorial objects that were first introduced due to a connection with the asymmetric simple exclusion process (ASEP) and Askey-Wilson polynomials. Since their introduction, staircase tableaux have been the object of study in many recent papers. Relevant to this paper, Hitczenko and Janson proved that distribution of parameters on the first diagonal is asymptotically normal. In addition, they conjectured that other diagonals would be asymptotically Poisson. Since then, only the second and the third diagonal were proven to follow the conjecture. This paper builds upon those results to prove the conjecture for the kth diagonal where k is fixed. In particular, we prove that the distribution of the number of α's (β's) on the kth diagonal, k > 1, is asymptotically Poisson with parameter 1/2. In addition, we prove that symbols on the kth diagonal are asymptotically independent and thus, collectively follow the Poisson distribution with parameter 1. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 795–818, 2016

In this paper we study direct and inverse problems for discrete and continuous skew-selfadjoint Dirac systems with rectangular (possibly non-square) pseudo-exponential potentials. For such a system the Weyl function is a strictly proper rational matrix function and any strictly proper rational matrix function appears in this way. In fact, extending earlier results, given a strictly proper rational matrix function we present an explicit procedure to recover the corresponding potential using techniques from mathematical system and control theory. We also introduce and study a nonlinear generalized discrete Heisenberg magnet model, extending earlier results for the isotropic case. A large part of the paper is devoted to the related discrete systems of which the pseudo-exponential potential depends on an additional continuous time parameter. Our technique allows us to obtain explicit solutions for the generalized discrete Heisenberg magnet model and evolution of the Weyl functions.

In recent years, Com–Poisson has emerged as one of the most popular discrete models in the analysis of count data owing to its flexibility in handling different types of dispersion. However, in a stationary longitudinal Com–Poisson count data set-up where the covariates are time independent, estimation of regression and dispersion parameters based on a generalized quasi-likelihood (GQL) approach involves some major computational difficulties particularly in the inversion of the joint covariance matrix. On the other hand, in practical real-life longitudinal studies, time-dependent covariates leading to non-stationary responses are more frequently encountered. This implies that further computational problems will now arise when estimating parameters under non-stationary set-ups. This paper overcomes this problem by approximating the inverse of the ill-conditioned covariance matrix in the GQL approach through a multidimensional conjugate gradient method. The performance of this novel version of the GQL approach is then assessed on simulations of AR(1) stationary and AR(1) non-stationary longitudinal Com–Poisson counts and on real-life epileptic seizure counts. However, there is not yet an algorithm to generate non-stationary longitudinal Com–Poisson counts nor a GQL algorithm to estimate the parameters under non-stationary set-ups. Thus, the paper also provides a framework to generate non-stationary AR(1) Com–Poisson counts along with the construction of a GQL equation under non-stationary set-ups.

In this paper we consider the system of the non-steady Navier–Stokes equations with mixed boundary conditions. We study the existence and uniqueness of a solution of this system. We define Banach spaces X and Y, respectively, to be the space of “possible” solutions of this problem and the space of its data. We define the operator and formulate our problem in terms of operator equations. Let and be the Frechet derivative of at . We prove that is one-to-one and onto Y. Consequently, suppose that the system is solvable with some given data (the initial velocity and the right hand side). Then there exists a unique solution of this system for data which are small perturbations of the previous ones. The next result proved in the Appendix of this paper is W2, 2-regularity of solutions of steady Stokes system with mixed boundary condition for sufficiently smooth data.

This is the first of a series of papers devoted to the initial value problem for the one-dimensional Euler system of compressible fluids and augmented versions containing higher-order terms. In the present paper, we are interested in dispersive shock waves and analyze the zero viscosity-capillarity limit associated with the Navier-Stokes-Korteweg system. Specifically, we establish the existence of finite energy solutions as well as their convergence toward entropy solutions to the Euler system. Our method of proof combines energy and effective energy estimates, a nonlinear Sobolev inequality, high-integrability properties for the mass density and for the velocity, and compactness properties based on entropies.© 2015 Wiley Periodicals, Inc.

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C|VG|. In this paper, we show that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph Gn,p, which improves upon existing results showing that asymptotically almost surely the cop number of Gn,p is Onlogn provided that pni¾?2+elogn for some e>0. We do this by first showing that the conjecture holds for a general class of graphs with some specific expansion-type properties. This will also be used in a separate paper on random d-regular graphs, where we show that the conjecture holds asymptotically almost surely when d=dni¾?3. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 396-421, 2016

The global existence of weak solutions of the incompressible viscoelastic flows in two spatial dimensions has been a longstanding open problem, and it is studied in this paper. We show global existence if the initial deformation gradient is close to the identity matrix in L2 ∩ L∞ and the initial velocity is small in L2 and bounded in Lp for some p > 2. While the assumption on the initial deformation gradient is automatically satisfied for the classical Oldroyd-B model, the additional assumption on the initial velocity being bounded in Lp for some p > 2 may due to techniques we employed. The smallness assumption on the L2 norm of the initial velocity is, however, natural for global well-posedness. One of the key observations in the paper is that the velocity and the “ effective viscous flux” G are sufficiently regular for positive time. The regularity of G leads to a new approach for the pointwise estimate for the deformation gradient without using L∞ bounds on the velocity gradients in spatial variables. © 2015 Wiley Periodicals, Inc.

This paper is devoted to one-dimensional interpolation Gagliardo-Nirenberg-Sobolev inequalities. We study how various notions of duality, transport and monotonicity of functionals along flows defined by some nonlinear diffusion equations apply. We start by reducing the inequality to a much simpler dual variational problem using mass transportation theory. Our second main result is devoted to the construction of a Lyapunov functional associated with a nonlinear diffusion equation, that provides an alternative proof of the inequality. The key observation is that the inequality on the line is equivalent to Sobolev's inequality on the sphere, at least when the dimension is an integer, or to the critical interpolation inequality for the ultraspherical operator in the general case. The time derivative of the functional along the flow is itself very interesting. It explains the machinery of some rigidity estimates for nonlinear elliptic equations and shows how eigenvalues of a linearized problem enter in the computations. Notions of gradient flows are then discussed for various notions of distances. Throughout this paper we shall deal with two classes of inequalities corresponding either to p>2 or to p

In this paper, we initiate the rigorous mathematical study of the problem of impulsive gravitational spacetime waves. We construct such spacetimes as solutions to the characteristic initial value problem of the Einstein vacuum equations with a data curvature delta singularity. We show that in the resulting spacetime, the delta singularity propagates along a characteristic hypersurface, while away from that hypersurface the spacetime remains smooth. Unlike the known explicit examples of impulsive gravitational spacetimes, this work in particular provides the first construction of an impulsive gravitational wave of compact extent and does not require any symmetry assumptions. The arguments in the present paper also extend to the problem of existence and uniqueness of solutions to a larger class of nonregular characteristic data. © 2015 Wiley Periodicals, Inc.

This paper is the continuation of a previous paper (H. Knupfer and C. B. Muratov, Comm. Pure Appl. Math. 66 (2013), 1129‐1162). We investigate the classical isoperimetric problem modified by an addition of a nonlocal repulsive term generated by a kernel given by an inverse power of the distance. In this work, we treat the case of a general space dimension. We obtain basic existence results for minimizers with sufficiently small masses. For certain ranges of the exponent in the kernel, we also obtain nonexistence results for sufficiently large masses, as well as a characterization of minimizers as balls for sufficiently small masses and low spatial dimensionality. The physically important special case of three space dimensions and Coulombic repulsion is included in all the results mentioned above. In particular, our work yields a negative answer to the question if stable atomic nuclei at arbitrarily high atomic numbers can exist in the framework of the classical liquid drop model of nuclear matter. In all cases the minimal energy scales linearly with mass for large masses, even if the infimum of energy cannot be attained. © 2014 Wiley Periodicals, Inc.

We consider connectivity properties of certain i.i.d. random environments on i¾?d, where at each location some steps may not be available. Site percolation and oriented percolation are examples of such environments. In these models, one of the quantities most often studied is the random set of vertices that can be reached from the origin by following a connected path. More generally, for the models we consider, multiple different types of connectivity are of interest, including: the set of vertices that can be reached from the origin; the set of vertices from which the origin can be reached; the intersection of the two. As with percolation models, many of the models we consider admit, or are expected to admit phase transitions. Among the main results of the paper is a proof of the existence of phase transitions for some two-dimensional models that are non-monotone in their underlying parameter, and an improved bound on the critical value for oriented site percolation on the triangular lattice. The connectivity of the random directed graphs provides a foundation for understanding the asymptotic properties of random walks in these random environments, which we study in a second paper. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 45, 111-137, 2014

In this paper, we first propose a concept of weighted pseudo-almost periodic functions on time scales and study some basic properties of weighted pseudo-almost periodic functions on time scales. Then, we establish some results about the existence of weighted pseudo-almost periodic solutions to linear dynamic equations on time scales. Finally, as an application of our results, we study the existence and global exponential stability of weighted pseudo-almost periodic solutions for a class of cellular neural networks with discrete delays on time scales. The results of this paper are completely new. Copyright © 2016 John Wiley & Sons, Ltd.

We give a possible generalization of Lutz twist to all dimensions. This reproves the fact that every contact manifold can be given a non-fillable contact structure and also shows great flexibility in the manifolds that can be realized as cores of overtwisted families. We moreover show that $R^{2n+1}$ has at least three distinct contact structures. This version of the paper contains both the texts of the published version of the paper together with an Erratum to the published version appended to the end., Comment: 19 pages, 2 figures, and erratum to the published version of the paper

Starting with a paper of Jacobson from the 1960s, many authors became interested in characterizing all algebraic number fields in which each integer is the sum of pairwise distinct units. Although there exist many partial results for number fields of low degree, a full characterization of these number fields is still not available. Narkiewicz and Jarden posed an analogous question for sums of units that are not necessarily distinct. In this paper we propose a generalization of these problems. In particular, for a given rational integer n we consider the following problem. Characterize all number fields for which every integer is a linear combination of finitely many units e i in a way that the coefficients a i ∈ℕ are bounded by n . The paper gives several partial results on this problem. In our proofs we exploit the fact that these representations are related to symmetric beta expansions with respect to Pisot bases.

This paper [1], which was published online on 1 June 2011, has been retracted by agreement between the authors, the journal’s Editor-in-Chief Derek Holt, the London Mathematical Society and Cambridge University Press. The retraction was agreed to prevent other authors from using incorrect mathematical results. (In this paper, we compute and verify the positivity of the Li coefficients for the Dirichlet $L$-functions using an arithmetic formula established in Omar and Mazhouda, J. Number Theory 125 (2007) no. 1, 50–58; J. Number Theory 130 (2010) no. 4, 1109–1114. Furthermore, we formulate a criterion for the partial Riemann hypothesis and we provide some numerical evidence for it using new formulas for the Li coefficients.)

For a flnite group G let i(G) denote the graph deflned on the non- identity elements of G in such a way that two distinct vertices are connected by an edge if and only if they generate G. In this paper it is shown that the graph i(G) contains a Hamiltonian cycle for many flnite groups G. In the literature many deep results about flnite simple groups G can equivalently be stated as theorems about i(G). Three examples are given. Guralnick and Shalev (10) showed that for su-ciently large G the graph i(G) has diameter at most 2. Guralnick and Kantor (9) showed that there is no isolated vertex in i(G). Finally, Breuer, Guralnick, Kantor (4) showed that the diameter of i(G) is at most 2 for all G. In this paper those flnite groups G are considered for which i(G) contains a Hamiltonian cycle. The following proposition reduces the investigations to those non-solvable groups G for which G=N is cyclic for any non-trivial normal subgroup N of G. Proposition 1.1. Let G be a flnite solvable group that has at least 4 elements. Then the graph i(G) contains a Hamiltonian cycle if and only if G=N is cyclic for all non-trivial normal subgroups N of G. The three main results of this paper are Theorems 1.2, 1.3, and 1.4.

In a landmark paper, D.Y. Kleinbock and G.A. Margulis established the fundamental Baker-Sprindzuk conjecture on homogeneous Diophantine approximation on manifolds. Subsequently, there has been dramatic progress in this area of research. However, the techniques developed to date do not seem to be applicable to inhomogeneous approximation. Consequently, the theory of inhomogeneous Diophantine approximation on manifolds remains essentially non-existent. In this paper we develop an approach that enables us to transfer homogeneous statements to inhomogeneous ones. This is rather surprising as the inhomogeneous theory contains the homogeneous theory and so is more general. As a consequence, we establish the inhomogeneous analogue of the Baker-Sprindzuk conjecture. Furthermore, we prove a complete inhomogeneous version of the profound theorem of Kleinbock, Lindenstrauss & Weiss on the extremality of friendly measures. The results obtained in this paper constitute the first step towards developing a coherent inhomogeneous theory for manifolds in line with the homogeneous theory., 37 pages: a final section on further developments has been added

For a smooth projective curve, the cycles of e-secant k-planes are among the most studied objects in classical enumerative geometry and there are well-known formulas due to Castelnuovo, Cayley and MacDonald concerning them. Despite various attempts, surprisingly little is known about the enumerative validity of such formulas. The aim of this paper is to completely clarify this problem in the case of the generic curve C of given genus. Using degeneration techniques and a few facts about the birational geometry of moduli spaces of stable pointed curves we determine precisely under which conditions the cycle of e-secant k-planes in non-empty and we compute its dimension. We also precisely determine the dimension of the variety of linear series on C carrying e-secant k-planes. In a different direction, in the last part of the paper we study the distribution of ramification points of the powers of a line bundle on C having prescribed ramification at a given point., Comment: 25 pages. Numerous changes suggested by the referee, several proofs explained in more detail. To appear in the Journal of the London Mathematical Society

Twenty-five years ago, Conway and Norton published their remarkable paper `Monstrous Moonshine', proposing a completely unexpected relationship between finite simple groups and modular functions. This paper reviews the progress made in broadening and understanding that relationship., 33 pages. 10 references added; minor changes to text

The very weak solution for the Stokes, Oseen and Navier-Stokes equations has been studied by several authors in the last decades in domains of Rn, n ≥ 2. The authors studied the Oseen and Navier-Stokes problems assuming a solenoidal convective velocity in a bounded domain Ω ⊂ R3 of class C1,1 for v ∈ Ls (Ω) for s ≥ 3 in some previous papers. The results for the Navier-Stokes equations were obtained by using a fixed-point argument over the Oseen problem. These results improve those of Galdi et al. , Farwig et al. and Kim for the Navier-Stokes equations, because a less regular domain Ω ⊂ R3 and more general hypothesis on the data are considered. In particular, the external forces must not be small. In this work, existence of weak, strong, regularised and very weak solution for the Oseen problem are proved, mainly assuming that v ∈ L3(Ω) and its divergence ∇ · v is sufficiently small in the W−1,3(Ω)-norm. In this sense, one extends the analysis made by the authors for a given solenoidal v in some previous papers. As a consequence, the existence of very weak solution for the Navier-Stokes problem (u, π) ∈ L3(Ω) × W−1,3(Ω)/R for a non-zero divergence condition is obtained in the 3D case. Ministerio de Ciencia e Innovación (España) MTM2009-12927 Ministerio de Economía y Competitividad MTM2012-32325

The statement (and the proof) of Theorem 4.1.1 of the paper ‘Mackey formula in type A’ [Proc. London. Math. Soc. (3) 80 (2000) 545–574] is false. In this corrigendum we provide a correct statement (and a correct proof). As a consequence, we see that Corollary 4.1.2 of the paper holds. So all the other statements in the paper are correct (up to minor misprints…).2000 Mathematical Subject Classification: 20G05, 20G40.