A supplement to the Davis–Gut law

Let {X,X_n;n1} be a sequence of i.i.d. real-valued random variables and set , n1. Let h() be a positive nondecreasing function such that . Define Lt=log_emax{e,t} for t0. In this note we prove that

if and only if E(X)=0 and E(X²)=1, where , t1. When h(t)≡1, this result yields what is called the Davis–Gut law. Specializing our result to h(t)=(Lt)^r, 0<r1, we obtain an analog of the Davis–Gut law.     

Constructing arithmetic subgroups of unipotent groups

Let G be a unipotent algebraic subgroup of some defined over . We describe an algorithm for finding a finite set of generators of the subgroup . This is based on a new proof of the result (in more general form due to Borel and Harish-Chandra) that such a finite generating set exists.     

The maximum edit distance from hereditary graph properties

For a graph property , the edit distance of a graph G from , denoted , is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying . What is the largest possible edit distance of a graph on n vertices from ? Denote this distance by .A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph essentially achieves the maximal distance from , proving: with high probability. The proof implicitly asserts the existence of such , but it does not supply a general tool for determining its value or the edit distance.In this paper, we determine the values of and for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of as a function of p.The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemerédi Regularity Lemma, Ramsey Theory and properties of random graphs.     

Biderivations of triangular algebras

Let be a triangular algebra. A bilinear map is called a biderivation if it is a derivation with respect to both arguments. In this paper we define the concept of an extremal biderivation, and prove that under certain conditions a biderivation of a triangular algebra is a sum of an extremal and an inner biderivation. The main result is then applied to (block) upper triangular matrix algebras and nest algebras. We also consider the question when a derivation of a triangular algebra is an inner derivation.     

Projective change between two classes of -metrics

In this paper, we find equations to characterize projective change between (α,β)-metric and Randers metric on a manifold with dimension n3, where α and are two Riemannian metrics, β and are two nonzero one forms. Moreover, we consider this projective change when F has some special curvature properties.     

Tensor-product approximation to operators and functions in high dimensions

In recent papers tensor-product structured Nyström and Galerkin-type approximations of certain multi-dimensional integral operators have been introduced and analysed. In the present paper, we focus on the analysis of the collocation-type schemes with respect to the tensor-product basis in a high spatial dimension d. Approximations up to an accuracy are proven to have the storage complexity with q independent of d, where N is the discrete problem size. In particular, we apply the theory to a collocation discretisation of the Newton potential with the kernel , , d3. Numerical illustrations are given in the case of d=3.     

Sur le groupe d'automorphismes des géométries paraboliques de rang 1

The aim of this article is to prove the following result, which generalizes the Ferrand–Obata theorem, concerning the conformal group of a Riemannian manifold, and the Schoen–Webster theorem about the automorphism group of a strictly pseudo-convex CR structure: let M be a connected manifold endowed with a regular Cartan geometry, modelled on the boundary of the hyperbolic space of dimension d2 over , being , , or the octonions . If the automorphism group of M does not act properly on M, then M is isomorphic, as a Cartan geometry, to X, or X minus a point.     

Eigenvalue estimates for non-normal matrices and the zeros of random orthogonal polynomials on the unit circle

We prove that for any n×n matrix, A, and z with |z|A, we have that . We apply this result to the study of random orthogonal polynomials on the unit circle.     

Discrepancies between metric dimension and partition dimension of a connected graph

Let and be graphs where the set of vertices is the set of points of the integer lattice and the set of edges consists of all pairs of vertices whose city block and chessboard distances, respectively, are 1.In this paper it is shown that the partition dimensions of these graphs are 3 and 4, respectively, while their metric dimensions are not finite. Also, for every n3 there exists an induced subgraph of of order 3n-1 with metric dimension n and partition dimension 3. These examples will answer a question raised by Chartrand, Salehi and Zhang. Furthermore, graphs of order n9 having partition dimension n-2 are characterized, thus completing the characterization of graphs of order n having partition dimension 2, n, or n-1 given by Chartrand, Salehi and Zhang. The list of these graphs includes 23 members.     

Complete solutions to the Oberwolfach problem for an infinite set of orders

Let n3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-factorisation of K_n if n is odd, or of K_n−I if n is even, in which each 2-factor is isomorphic to F. We show that there is an infinite set of primes congruent to such that OP(F) has a solution for any 2-regular graph F of order . We also show that for each of the infinitely many with prime, OP(F) has a solution for any 2-regular graph F of order n.     

Finite automata presentable abelian groups

We give new examples of FA presentable torsion-free abelian groups. Namely, for every n2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group in which every nontrivial cyclic subgroup is not FA recognizable.     

Global well-posedness and scattering for the energy-critical, defocusing Hartree equation for radial data

We consider the defocusing, -critical Hartree equation for the radial data in all dimensions (n5). We show the global well-posedness and scattering results in the energy space. The new ingredient in this paper is that we first take advantage of the term in the localized Morawetz identity to rule out the possibility of energy concentration, instead of the classical Morawetz estimate dependent of the nonlinearity.     

Lattices generated by subspaces in d-bounded distance-regular graphs

Let Γ denote a d-bounded distance-regular graph with diameter d2. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. Define the empty set to be the subspace with diameter -1 in Γ. For 0ii+sd-1, let denote the set of all subspaces in Γ with diameters i,i+1,…,i+s including Γ and . If we define the partial order on by ordinary inclusion (resp. reverse inclusion), then is a poset, denoted by (resp. ). In the present paper we show that both and are atomic lattices, and classify their geometricity.     

disjoint cycles containing specified independent vertices

Let k1 be an integer and G be a graph of order n3k satisfying the condition that σ₂(G)n+k-1. Let v₁,…,v_k be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C₁,…,C_k with v_iV(C_i) for all 1ik.Then G has k vertex-disjoint cycles such that

(i) for all 1ik.

(ii) , and

(iii) At least k-1 of the k cycles are triangles.

The condition of degree sum σ₂(G)n+k-1 is sharp.

Variations on a theme of Jost and Pais

We explore the extent to which a variant of a celebrated formula due to Jost and Pais, which reduces the Fredholm perturbation determinant associated with the Schrödinger operator on a half-line to a simple Wronski determinant of appropriate distributional solutions of the underlying Schrödinger equation, generalizes to higher dimensions. In this multi-dimensional extension the half-line is replaced by an open set , , n2, where Ω has a compact, nonempty boundary ∂Ω satisfying certain regularity conditions. Our variant involves ratios of perturbation determinants corresponding to Dirichlet and Neumann boundary conditions on ∂Ω and invokes the corresponding Dirichlet-to-Neumann map. As a result, we succeed in reducing a certain ratio of modified Fredholm perturbation determinants associated with operators in L²(Ω;dⁿx), , to modified Fredholm determinants associated with operators in L²(∂Ω;dⁿ⁻¹σ), n2. Applications involving the Birman–Schwinger principle and eigenvalue counting functions are discussed.     

On a Liouville phenomenon for entire weak supersolutions of elliptic partial differential equations

We study a new Liouville-type phenomenon for entire weak supersolutions of elliptic partial differential equations of the form A(u)=0 on , n2. Typical examples of the operator A(u) are the p-Laplacian for p>1, the mean curvature operator, and their well-known modifications.     

On the mean value of

Let χ be the Dirichlet character modulo q3 and L(s,χ) denote the corresponding Dirichlet L-function. The mean value of is studied and a few asymptotic formulae are given. Hybrid mean value of , general Kloosterman sums and general quadratic Gauss sums are considered.     

On an extremal problem of Selberg II

Let m_p be the minimum of the product under the conditions that and . In our previous paper [J. Kaneko, On an extremal problem of Selberg, J. Approx. Theory 142 (2006) 129–137], we showed that the following estimates hold. provided p255. In this note, we prove that the limit of as p→∞ exists and is expressed by the (unique) solution of some simultaneous transcendental equations. By using this expression we obtain numerically.     

Weakly sequentially continuous differentiable mappings

It is well known that a (linear) operator between Banach spaces is completely continuous if and only if its adjoint takes bounded subsets of Y^* into uniformly completely continuous subsets, often called (L)-subsets, of X^*. We give similar results for differentiable mappings. More precisely, if UX is an open convex subset, let be a differentiable mapping whose derivative is uniformly continuous on U-bounded subsets. We prove that f takes weak Cauchy U-bounded sequences into convergent sequences if and only if f^′ takes Rosenthal U-bounded subsets of U into uniformly completely continuous subsets of . As a consequence, we extend a result of P. Hájek and answer a question raised by R. Deville and E. Matheron. We derive differentiable characterizations of Banach spaces not containing ℓ₁ and of Banach spaces without the Schur property containing a copy of ℓ₁. Analogous results are given for differentiable mappings taking weakly convergent U-bounded sequences into convergent sequences. Finally, we show that if X has the hereditary Dunford–Pettis property, then every differentiable function as above is locally weakly sequentially continuous.     

A note on the distance between two consecutive zeros of m-orthogonal polynomials for a generalized Jacobi weight

Let , with

-1=x_0n<x_1n<<x_nn<x_n+1,n=1