Evolution of spacelike surfaces in \mathrm{AdS}_3 by their Lagrangian angle

We study spacelike hypersurfaces $M$ in an anti-De Sitter spacetime $N$ of constant sectional curvature $-\kappa , \kappa >0$ that evolve by the Lagrangian angle of their Gauß maps. In the two dimensional case we prove a convergence result to a maximal spacelike surface, if the Gauß curvature $K$ of the initial surface $M\subset N$ and the sectional curvature of $N$ satisfy $|K|<\kappa $ .     

Graver basis and proximity techniques for block-structured separable convex integer minimization problems

We consider $N$ -fold $4$ -block decomposable integer programs, which simultaneously generalize $N$ -fold integer programs and two-stage stochastic integer programs with $N$ scenarios. In previous work (Hemmecke et al. in Integer programming and combinatorial optimization. Springer, Berlin, 2010), it was proved that for fixed blocks but variable  $N$ , these integer programs are polynomial-time solvable for any linear objective. We extend this result to the minimization of separable convex objective functions. Our algorithm combines Graver basis techniques with a proximity result (Hochbaum and Shanthikumar in J. ACM 37:843–862,1990), which allows us to use convex continuous optimization as a subroutine.     

Equivariant entire solutions to the elliptic system \Delta u=W_u(u) for general G-invariant potentials

We consider the system $\Delta u - W_u(u) = 0$ , where $u: \mathbb R ^n \rightarrow \mathbb R ^m$ , for potentials $W: \mathbb R ^m \rightarrow \mathbb R $ that possess $N$ global minima and are invariant under a finite reflection group $G$ . We prove the existence of nontrivial $G$ -equivariant entire solutions connecting the $N$ minima of $W$ . Our proof only requires the minima of $W$ to be nondegenerate and an assumption on the behavior of $W$ for large $u$ .     

Distinct Distances on Curves Via Rigidity

It is shown that $N$ points on a real algebraic curve of degree $n$ in ${\mathbb R}^d$ always determine $\gtrsim _{n,d}$ ${N^{1+\frac{1}{4}}}$ distinct distances, unless the curve is a straight line or the closed geodesic of a flat torus. In the latter case, there are arrangements of $N$ points which determine $\lesssim $ ${N}$ distinct distances. The method may be applied to other quantities of interest to obtain analogous exponent gaps. An important step in the proof involves understanding the structural rigidity of certain frameworks on curves.     

Clock synchronization in symmetric stochastic networks

We consider a stochastic model of clock synchronization in a wireless network of $N$ sensors interacting with one dedicated accurate time server. For large $N$ we find an estimate of the final time sychronization error for global and relative synchronization. The main results concern the behavior of the network on different timescales $t_{N}\rightarrow \infty $ , $N\rightarrow \infty $ . We discuss the existence of phase transitions and find the exact timescales for which an effective clock synchronization of the system takes place.     

A Question from a Famous Paper of Erdős

Given a convex body $K$ K , consider the smallest number $N$ N so that there is a point $P\in \partial K$ P ∈ ? K such that every circle centred at $P$ P intersects $\partial K$ ? K in at most $N$ N points. In 1946 Erd?s conjectured that $N=2$ N = 2 for all $K$ K , but there are convex bodies for which this is not the case. As far as we know there is no known global upper bound. We show that no convex body has $N=\infty $ N = ∞ and that there are convex bodies for which $N = 6$ N = 6 .     

Syzygies and tensor product of modules

We give an application of the New Intersection Theorem and prove the following: let $R$ be a local complete intersection ring of codimension $c$ and let $M$ and $N$ be nonzero finitely generated $R$ -modules. Assume $n$ is a nonnegative integer and that the tensor product $M\otimes _{R}N$ is an $(n+c)$ th syzygy of some finitely generated $R$ -module. If ${{\mathrm{Tor}}}^{R}_{>0}(M,N)=0$ , then both $M$ and $N$ are $n$ th syzygies of some finitely generated $R$ -modules.     

Reducibility and Unitarily Equivalence for a Class of Analytic Multipliers on the Dirichlet Space

In this paper, we first prove that if $\phi $ is a finite Blaschke product with $N=2,3$ zeros, then $M_\phi $ is reducible on the Dirichlet space if and only if $\phi $ is equivalent to $z^N$ . Also, we prove that $M_\phi $ is unitary equivalent to Dirichlet shift of multiplicity $N$ if and only if $\phi =\lambda z^N$ for some unimodular constant $\lambda $ .     

Objective Bayesian analysis for a capture–recapture model

In this paper, we study a special capture–recapture model, the $M_t$ model, using objective Bayesian methods. The challenge is to find a justified objective prior for an unknown population size $N$ . We develop an asymptotic objective prior for the discrete parameter $N$ and the Jeffreys’ prior for the capture probabilities $\varvec{\theta }$ . Simulation studies are conducted and the results show that the reference prior has advantages over ad-hoc non-informative priors. In the end, two real data examples are presented.     

Characterization of Siegel cusp forms by the growth of their Fourier coefficients

We characterize all Siegel cusp forms of degree $n$ and large weight $k$ by the growth of their Fourier coefficients. More precisely we prove, among other related results, that if the Fourier coefficients of a modular form on the congruence subgroup $\Gamma _0^n(N)$ of square–free level $N$ satisfy the “Hecke bound” at the cusp $\infty $ , then it must be a cusp form, provided $k >2n+1$ .     

Heegner cycles and higher weight specializations of big Heegner points

Let ${\mathbf{{f}}}$ be a $p$ -ordinary Hida family of tame level $N$ , and let $K$ be an imaginary quadratic field satisfying the Heegner hypothesis relative to $N$ . By taking a compatible sequence of twisted Kummer images of CM points over the tower of modular curves of level $\Gamma _0(N)\cap \Gamma _1(p^s)$ , Howard has constructed a canonical class $\mathfrak{Z }$ in the cohomology of a self-dual twist of the big Galois representation associated to ${\mathbf{{f}}}$ . If a $p$ -ordinary eigenform $f$ on $\Gamma _0(N)$ of weight $k>2$ is the specialization of ${\mathbf{{f}}}$ at $\nu $ , one thus obtains from $\mathfrak{Z }_{\nu }$ a higher weight generalization of the Kummer images of Heegner points. In this paper we relate the classes $\mathfrak{Z }_{\nu }$ to the étale Abel-Jacobi images of Heegner cycles when $p$ splits in $K$ .     

A quenched invariance principle for non-elliptic random walk in i.i.d. balanced random environment

We consider a random walk on $\mathbb{Z }^d,\ d\ge 2$ , in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from $x\in \mathbb{Z }^d$ to nearest neighbor $x+e$ is the same as to nearest neighbor $x-e$ . Assuming that the environment is genuinely $d$ -dimensional and balanced we show a quenched invariance principle: for $P$ almost every environment, the diffusively rescaled random walk converges to a Brownian motion with deterministic non-degenerate diffusion matrix. Within the i.i.d. setting, our result extend both Lawler’s uniformly elliptic result (Comm Math Phys, 87(1), pp 81–87, 1982/1983) and Guo and Zeitouni’s elliptic result (to appear in PTRF, 2010) to the general (non elliptic) case. Our proof is based on analytic methods and percolation arguments.     

Wild quotient singularities of surfaces

Let $(B,\mathcal{M }_B)$ be a noetherian regular local ring of dimension $2$ with residue field $B/\mathcal{M }_B$ of characteristic $p>0$ . Assume that $B$ is endowed with an action of a finite cyclic group $H$ whose order is divisible by $p$ . Associated with a resolution of singularities of $\mathrm{Spec}B^H$ is a resolution graph $G$ and an intersection matrix $N$ . We prove in this article three structural properties of wild quotient singularities, which suggest that in general, one should expect when $H= \mathbb{Z }/p\mathbb{Z }$ that the graph $G$ is a tree, that the Smith group $\mathbb{Z }^n/\mathrm{Im}(N)$ is killed by $p$ , and that the fundamental cycle $Z$ has self-intersection $|Z^2|\le p$ . We undertake a combinatorial study of intersection matrices $N$ with a view towards the explicit determination of the invariants $\mathbb{Z }^n/\mathrm{Im}(N)$ and $Z$ . We also exhibit explicitly the resolution graphs of an infinite set of wild $\mathbb{Z }/2\mathbb{Z }$ -singularities, using some results on elliptic curves with potentially good ordinary reduction which could be of independent interest.     

Minimum total coloring of planar graph

Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph, which is familiar to us by the name of “total coloring”. Total coloring is a coloring of \(V\cup {E}\) such that no two adjacent or incident elements receive the same color. In other words, total chromatic number of \(G\) is the minimum number of disjoint vertex independent sets covering a total graph of \(G\) . Here, let \(G\) be a planar graph with \(\varDelta \ge 8\) . We proved that if for every vertex \(v\in V\) , there exists two integers \(i_{v},j_{v} \in \{3,4,5,6,7,8\}\) such that \(v\) is not incident with intersecting \(i_v\) -cycles and \(j_v\) -cycles, then the vertex chromatic number of total graph of \(G\) is \(\varDelta +1\) , i.e., the total chromatic number of \(G\) is \(\varDelta +1\) .     

Generalized sub-Gaussian fractional Brownian motion queueing model

It is well known that often the one-dimensional distribution of a queue content is not Gaussian but its tails behave like a Gaussian. We propose to consider a general class of processes, namely the class of $\varphi $ -sub-Gaussian random processes, which is more general than the Gaussian one and includes non-Gaussian processes. The class of sub-Gaussian random processes contains Gaussian processes also and therefore is of special interest. In this paper we provide an estimate for the queue content distribution of a fluid queue fed by $N$ independent strictly $\varphi $ -sub-Gaussian generalized fractional Brownian motion input processes. We obtain an upper estimate of buffer overflow probability in a finite buffer system defined on any finite time interval $[a,b]$ or infinite interval $[0,\infty )$ . The derived estimate captures more accurately the performance of the queueing system for a wider-range of input processes.     

On the sup-norm of Maass cusp forms of large level. III

Let $f$ be a Hecke–Maass cuspidal newform of square-free level $N$ and Laplacian eigenvalue $\lambda $ . It is shown that $\left||f \right||_\infty \ll _{\lambda ,\epsilon } N^{-\frac{1}{6}+\epsilon } \left||f \right||_2$ for any $\epsilon >0$ .     

Join the shortest queue among k parallel queues: tail asymptotics of its stationary distribution

We are concerned with an $M/M$ -type join the shortest queue ( $M/M$ -JSQ for short) with $k$ parallel queues for an arbitrary positive integer $k$ , where the servers may be heterogeneous. We are interested in the tail asymptotic of the stationary distribution of this queueing model, provided the system is stable. We prove that this asymptotic for the minimum queue length is exactly geometric, and its decay rate is the $k$ th power of the traffic intensity of the corresponding $k$ server queues with a single waiting line. For this, we use two formulations, a quasi-birth-and-death (QBD for short) process and a reflecting random walk on the boundary of the $k+1$ -dimensional orthant. The QBD process is typically used in the literature for studying the JSQ with two parallel queues, but the random walk also plays a key roll in our arguments, which enables us to use the existing results on tail asymptotics for the QBD process.     

Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets

We present explicit constructions of centrally symmetric $2$ -neighborly $d$ -dimensional polytopes with about $3^{d/2}\approx (1.73)^d$ vertices and of centrally symmetric $k$ -neighborly $d$ -polytopes with about $2^{{3d}/{20k^2 2^k}}$ vertices. Using this result, we construct for a fixed $k\ge 2$ and arbitrarily large $d$ and $N$ , a centrally symmetric $d$ -polytope with $N$ vertices that has at least $\left( 1-k^2\cdot (\gamma _k)^d\right) \genfrac(){0.0pt}{}{N}{k}$ faces of dimension $k-1$ , where $\gamma _2=1/\sqrt{3}\approx 0.58$ and $\gamma _k = 2^{-3/{20k^2 2^k}}$ for $k\ge 3$ . Another application is a construction of a set of $3^{\lfloor d/2 -1\rfloor }-1$ points in $\mathbb R ^d$ every two of which are strictly antipodal as well as a construction of an $n$ -point set (for an arbitrarily large $n$ ) in $\mathbb R ^d$ with many pairs of strictly antipodal points. The two latter results significantly improve the previous bounds by Talata, and Makai and Martini, respectively.     

Passage time from four to two blocks of opinions in the voter model and walks in the quarter plane

A random walk in $\mathbf{Z}_+^2$ spatially homogeneous in the interior, absorbed at the axes, starting from an arbitrary point $(i_0,j_0)$ and with step probabilities drawn on Fig. 1 is considered. The trivariate generating function of probabilities that the random walk hits a given point $(i,j) \in \mathbf{Z}_+^2 $ at a given time $k\ge 0$ is made explicit. Probabilities of absorption at a given time $k$ and at a given axis are found, and their precise asymptotic is derived as the time $k\rightarrow \infty $ . The equivalence of two typical ways of conditioning this random walk to never reach the axes is established. The results are also applied to the analysis of the voter model with two candidates and initially, in the population $\mathbf{Z}$ , four connected blocks of same opinions. Then, a citizen changes his mind at a rate proportional to the number of his neighbors that disagree with him. Namely, the passage from four to two blocks of opinions is studied.     

A metrical lower bound on the star discrepancy of digital sequences

In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$ -dimensional digital sequences $\mathcal{S }$ the star discrepancy $D_N^*$ satisfies an upper bound of the form $D_N^*(\mathcal{S })=O((\log N)^s (\log \log N)^{2+\varepsilon })$ for any $\varepsilon >0$ . Generally speaking it is much more difficult to obtain good lower bounds for specific sequences than upper bounds. Here we show that Larchers result is best possible up to some $\log \log N$ term. More detailed, we prove that for almost all $s$ -dimensional digital sequences $\mathcal{S }$ the star discrepancy satisfies $D_N^*(\mathcal{S }) \ge c(q,s) (\log N)^s \log \log N$ for infinitely many $N \in \mathbb{N }$ , where $c(q,s)>0$ only depends on $q$ and $s$ but not on $N$ .