THE WEINSTEIN CONJECTURE ON C~1-SMOOTH HYPERSURFACE OF CONTACT TYPE

In this note a symplectic capacity of Hofer-Zehnder type that is only invariant under C1-symplectomorphisms is defined and all computation formulae for Hofer-Zehnder symplectic capacity obtained at present are proved still holding for it. As a consequence some results on Weinstein conjecture are generalized to C1-smooth hypersurface of contact type.     

NOTES ON ERDOS' CONJECTURE

Let Xn,n 1,be a sequence of independent random variables satisfying P(Xn = O) = 1 － P(Xn = an) = 1 － 1/pn,where an,n 1,is a sequence of real numbers,andpn isthenthprime,setFN(x)=P(N∑Xnn=1 x).The authors investigate a conjecture of Erdos in probabilistic number theory and show that in order for the sequence FN to be weakly convergent,it is both sufficient and necessary that there exist three numbers x0 and x1 ＜ x2 such that limsup(FN(x2) －FN(x1)) ＞ 0 holds,and Lo =N→∞ lim FN(x0) exists.Moreover,the authors point ont that they can also obtain the same N→∞ result in the weakened case of liminfP(Xn = 0) ＞ 0.n→∞     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

Freeness for 13 lines arrangements is combinatorial

We prove Terao conjecture saying that the freeness is determined by the combinatorics for arrangements of 13 lines in the complex projective plane.     

On the Positivity of the Coefficients of a Certain Polynomial Defined by Two Positive Definite Matrices

It is shown that the polynomialp(t) = Tr[(A+tB)^m]has positive coefficients when m = 6 and A and B are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior, general results. This problem arises from a conjecture raised by Bessis, Moussa, and Villani in connection with a long-standing problem in theoretical physics. The full conjecture, as shown recently by Lieb and Seiringer, is equivalent to p(t) having positive coefficients for any m and any two n-by-n positive definite matrices. We show that, generally, the question in the real case reduces to that of singular A and B, and this is a key part of our proof.     

Bounds and inequalities for single server loss systems

We consider a single server loss system in which arrivals occur according to a doubly stochastic Poisson process with a stationary ergodic intensity functionλ _t . The service times are independent, exponentially distributed r.v.'s with meanμ ⁻¹, and are independent of arrivals. We obtain monotonicity results for loss probabilities under time scaling as well as under amplitude scaling ofλ _t . Moreover, using these results we obtain both lower and upper bounds for the loss probability.     

An old conjecture of Erdos-Turán on additive bases

There is a 1941 conjecture of Erdos and Turán on what is now called additive basis that we restate:

Conjecture 0.1(Erdos and Turán). Suppose that is an increasing sequence of integers and

Suppose that

If 0$"> for all , then is unbounded.

Our main purpose is to show that the sequence cannot be bounded by . There is a surprisingly simple, though computationally very intensive, algorithm that establishes this.

     

ON A PAIR OF NON-ISOMETRIC ISOSPECTRAL DOMAINS WITH FRACTAL BOUNDARIES AND THE WEYL-BERRY CONJECTURE

ＯＮＡＰＡＩＲＯＦＮＯＮＩＳＯＭＥＴＲＩＣＩＳＯＳＰＥＣＴＲＡＬＤＯＭＡＩＮＳＷＩＴＨＦＲＡＣＴＡＬＢＯＵＮＤＡＲＩＥＳＡＮＤＴＨＥＷＥＹＬＢＥＲＲＹＣＯＮＪＥＣＴＵＲＥＳＬＥＥＭＡＮ，Ｂ．Ｄ．ＣＨＥＮＨＵＡＭａｎｕｓｃｒｉｐｔｒｅｃ...