A refinement of Nesterenko’s linear independence criterion with applications to zeta values

We refine (and give a new proof of) Nesterenko’s famous linear independence criterion from 1985, by making use of the fact that some coefficients of linear forms may have large common divisors. This is a typical situation appearing in the context of hypergeometric constructions of mathbbQ{mathbb{Q}}-linear forms involving zeta values or their q-analogs. We apply our criterion to sharpen previously known results in this direction.     

On Wilking’s criterion for the Ricci flow

Wilking has recently shown that one can associate a Ricci flow invariant cone of curvature operators $C(S)$ , which are nonnegative in a suitable sense, to every $Ad_{SO(n,\mathbb{C })}$ invariant subset $S \subset \mathbf{so}(n,\mathbb{C })$ . In this article we show that if $S$ is an $Ad_{SO(n,\mathbb{C })}$ invariant subset of $\mathbf{so}(n,\mathbb{C })$ such that $S\cup \{0\}$ is closed and $C_+(S)\subset C(S)$ denotes the cone of curvature operators which are positive in the appropriate sense then one of the two possibilities holds: (a) The connected sum of any two Riemannian manifolds with curvature operators in $C_+(S)$ also admits a metric with curvature operator in $C_+(S)$ (b) The normalized Ricci flow on any compact Riemannian manifold $M$ with curvature operator in $C_+(S)$ converges to a metric of constant positive sectional curvature. We also point out that if $S$ is an arbitrary $Ad_{SO(n,\mathbb{C })}$ subset, then $C(S)$ is contained in the cone of curvature operators with nonnegative isotropic curvature.     

Robin’s criterion on divisibility

The Ramanujan Journal - Robin’s criterion states that the Riemann hypothesis is true if and only if the inequality $$\sigma (n) < e^{\gamma } \times n \times \log \log n$$ holds for...     

A remark on Nesterenko’s theorem for Ramanujan functions

We study the algebraic independence of values of the Ramanujan q-series $A_{2j+1}(q)=\sum_{n=1}^{\infty}n^{2j+1}q^{2n}/(1-q^{2n})$ or S _2j+1(q) (j≥0). It is proved that, for any distinct positive integers i, j satisfying $(i,j)\not=(1,3)$ and for any $q\in \overline{ \mathbb{Q}}$ with 0<|q|<1, the numbers A ₁(q), A _2i+1(q), A _2j+1(q) are algebraically independent over $\overline{ \mathbb{Q}}$ . Furthermore, the q-series A _2i+1(q) and A _2j+1(q) are algebraically dependent over $\overline{ \mathbb{Q}}(q)$ if and only if (i,j)=(1,3).     

Ando’s theorem for nonnegative forms

In this paper, we present a generalization of Ando??s theorem for nonnegative forms. He proved that the infimum of two positive operators A and B exists in the positive cone if and only if the generalized shorts [B]A and [A]B are comparable (see Ando et?al. in Problem of infimum in the positive cone, analytic and geometric inequalities and applications, Math. Appl. 478, pp 1?C12, 1999). That is, [A]B??? [B]A or [B]A??? [A]B. Using the concept of the parallel sum of nonnegative forms, Hassi, Sebestyén and de Snoo investigated the decomposability of a nonnegative form ${\mathfrak{t}}$ into an almost dominated and a singular part with respect to a nonnegative form ${\mathfrak{w}}$ (see Hassi et?al. in J. Funct. Anal. 257(12), 3858?C3894, 2009). Applying their results, we formulate a necessary and sufficient condition for the existence of the infimum of two nonnegative forms.     

Normal forms under Simon’s congruence

Simon’s congruence, denoted by \(\sim _k\), relates the words having the same subwords of length at most k. In this paper a normal form is presented for the equivalence classes of \(\sim _k\). The length of this normal form is the shortest possible. Moreover, a canonical solution of the equation \(pwq\sim _k r\) is also shown (the words p, q, r are parameters), which can be viewed as a generalization of giving a normal form for \(\sim _k\). In this paper, there can be found an algorithm with which the canonical solution can be determined in \(O((L+n)n^{k})\) time, where L denotes the length of the word pqr and n is the size of the alphabet.     

On Stoll’s criterion for the maximality of quadratic arboreal Galois representations

Archiv der Mathematik - We show that for a quadratic polynomial $$f(x)=x^2-c$$ , where $$c=(8k+2)(8k+3)$$ or $$c=(4k+1)(4k+2)+1$$ with $$kin {mathbb {N}}cup {0}$$ , the Galois group of the...     

Little’s law when the average waiting time is infinite

One version of Little’s law, written as $L = \lambda w$ , is a relation between averages along a sample path. There are two others in a stochastic setting; they readily extend to the case where the average waiting time $w$ is infinite. We investigate conditions for the sample-path version of this case to hold. Published proofs assume (our) Eq. (3) holds. It is only sufficient. We present examples of what may happen when (3) does not hold, including one that may be new where $w$ is infinite and $L$ is finite. We obtain a sufficient condition called “weakly FIFO” that is weaker than (3), and through truncation, a necessary and sufficient condition. We show that (3) is sufficient but not necessary for the departure rate to be equal to the arrival rate.     

Sch’nol’s theorem for strongly local forms

We prove a variant of Sch’nol’s theorem in a general setting: for generators of strongly local Dirichlet forms perturbed by measures. As an application, we discuss quantum graphs with δ- or Kirchhoff boundary conditions.     

An efficient method for feature selection in linear regression based on an extended Akaike’s information criterion

A method for feature selection in linear regression based on an extension of Akaike’s information criterion is proposed. The use of classical Akaike’s information criterion (AIC) for feature selection assumes the exhaustive search through all the subsets of features, which has unreasonably high computational and time cost. A new information criterion is proposed that is a continuous extension of AIC. As a result, the feature selection problem is reduced to a smooth optimization problem. An efficient procedure for solving this problem is derived. Experiments show that the proposed method enables one to efficiently select features in linear regression. In the experiments, the proposed procedure is compared with the relevance vector machine, which is a feature selection method based on Bayesian approach. It is shown that both procedures yield similar results. The main distinction of the proposed method is that certain regularization coefficients are identical zeros. This makes it possible to avoid the underfitting effect, which is a characteristic feature of the relevance vector machine. A special case (the so-called nondiagonal regularization) is considered in which both methods are identical.     

On a result of Fel’dman on linear forms in the values of some E-functions

The Ramanujan Journal - We shall consider a result of Fel’dman, where a sharp Baker-type lower bound is obtained for linear forms in the values of some E-functions. Fel’dman’s...     

Sharp forms of nevanlinna’s error terms

Let f(z) be a meromorphic function in the plane. If ψ(t)/t andp(t) are two positive, continuous and non-decreasing functions on [1,∞) with ∫ ₁ ^∞ dt/ψ(t) = ∞ and ∫ ₁ ^∞ dt/p(t) = ∞, then asr → ∞ outside a small exceptional set, provided that the divergence of the integral ∫ ₁ ^r dt/ψ(t) is slow enough. The same forms for the logarithmic derivative and for the ramification term are obtained. It is shown by example that the estimates are best possible. Author supported by Max-Planck-Gesellschaft Z.F.D.W and by NSFC.     

An extension of Babbage’s criterion for primality

Let n > 1 and k > 1 be positive integers. We show that if $$\left( {\begin{array}{*{20}c} {n + m} \\ n \\ \end{array} } \right) \equiv 1 (\bmod k)$$ for each integer m with 0 ≤ m ≤ n ? 1, then k is a prime and n is a power of this prime. In particular, this assertion under the hypothesis that n = k implies that n is a prime. This was proved by Babbage, and thus our result may be considered as a generalization of this criterion for primality.     

Testing the general linear hypothesis Via K. Pearson’s chi-squared statistic

In a linear model Y ∼ (Xβ, σ ² I), powers of tests of H₀: H′Xβ= 0 are developed following Pearson’s (1900) formulation. The class considered comprises all tests based on linear statistics A′ Y that have expected value 0 under H₀. The standard F-statistic, which is in this class, has good power properties, but others may be preferred in some settings.     

Hardy’s theorem for zeta-functions of quadratic forms

LetQ(u ₁,…,u ₁) =Σd _ij u _i u _j (i,j = 1 tol) be a positive definite quadratic form inl(≥3) variables with integer coefficientsd _ij (=d _ji ). Puts=σ+it and for σ>(l/2) write $$Z_Q (s) = \Sigma '(Q(u_1 ,...,u_l ))^{ - s} ,$$ where the accent indicates that the sum is over alll-tuples of integer (u ₁,…,u _l ) with the exception of (0,…, 0). It is well-known that this series converges for σ>(l/2) and that (s-(l/2))Z _Q (s) can be continued to an entire function ofs. Let σ be any constant with 0<σ<1/100. Then it is proved thatZ _Q (s)has ?_δTlogT zeros in the rectangle(|σ-1/2|≤δ, T≤t≤2T).     

On Waring’s problem for several algebraic forms

We reconsider the classical problem of representing a finite number of forms of degree d in the polynomial ring over n + 1 variables as scalar combinations of powers of linear forms. We define a geometric construct called a grove, which, in a number of cases, allows us to determine the dimension of the space of forms which can be so represented for a fixed number of summands. We also present two new examples, where this dimension turns out to be less than what a naïve parameter count would predict.     

Semi-invariants of binary forms and Sylvester’s theorem

The Ramanujan Journal - We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in...