Absolutely P-Summing, P-Nuclear Operators and Their Conjugates.
Mach and Einstein. A posthumous dialogue
Stationary gaussian random fields on hyperbolic spaces and on euclidean spheres
We recall necessary notions about the geometry and harmonic analysis on a hyperbolic space and provide lecture notes about homogeneous random functions parameterized by this space. The general principles are illustrated by construction of numerous examples analogous to Euclidean case. We also give a brief survey of the fields parameterized by Euclidean spheres. At the end we give a list of important open questions in hyperbolic case.
Optimization Problems for KG.
Stationary Gaussian random fields on hyperbolic spaces and on Euclidean spheres
We recall necessary notions about the geometry and harmonic analysis on a hyperbolic space and provide lecture notes about homogeneous random functions parameterized by this space. The general principles are illustrated by construction of numerous examples analogous to Euclidean case. We also give a brief survey of the fields parameterized by Euclidean spheres. At the end we give a list of important open questions in hyperbolic case.
The irreducibility of compositions of linear polynomials over a finite field
Corrigendum: "Galois groups of trinomials" (Acta Arith. 54 (1989), 43-49)
Partition-based conditional density estimation
We propose a general partition-based strategy to estimate conditional density with candidate densities that are piecewise constant with respect to the covariate. Capitalizing on a general penalized maximum likelihood model selection result, we prove, on two specific examples, that the penalty of each model can be chosen roughly proportional to its dimension. We first study a strategy in which the densities are chosen piecewise conditional according to the variable. We then consider Gaussian mixture...
Incomplete character sums and a special class of permutations
We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.
Double transitivity of Galois groups of trinomials
Page 1