Linear transformations of monotone functions on the discrete cube

For a function f:{0,1}ⁿ→R and an invertible linear transformation L∈GL_n(2), we consider the function Lf:{0,1}ⁿ→R defined by Lf(x)=f(Lx). We raise two conjectures: First, we conjecture that if f is Boolean and monotone then I(Lf)≥I(f), where I(f) is the total influence of f. Second, we conjecture that if both f and L(f) are monotone, then f=L(f) (up to a permutation of the coordinates). We prove the second conjecture in the case where L is upper triangular.     

The Fourier-Walsh series of the functions absolutely continuous in the generalized restricted sense

We consider the questions of convergence in Lorentz spaces for the Fourier-Walsh series of the functions with Denjoy integrable derivative. We prove that a condition on a function f sufficient for its Fourier-Walsh series to converge in the Lorentz spaces “near” L _∞ cannot be expressed in terms of the growth of the derivative f′.     

Unified treatment for the evaluation of generalized complete and incomplete gamma functions

The present work applies the binomial expansion theorems to evaluate the generalized complete and incomplete gamma functions arising in the wave scattering and diffraction theory. A simple and efficient algorithm for the calculation of these functions is developed. Some numerical results are presented for significant mapping examples and they are briefly discussed. The formulas obtained are numerically stable for all values of parameters occurring in generalized complete and incomplete gamma functions.     

Extreme harmonic functions on a ball

In order to show that one can recapture the Riesz-Herglotz theorem from the Krein-Milman theorem, we determine directly the set of extreme points of the convex set of positive harmonic functions on the unit ball (normalized by 1 at the origin). The characterization is obtained using standard facts from abstract analysis combined with a minimum of very basic results on harmonic functions.     

On derivatives of Bernstein type rational functions of two variables

In this paper the author defines Bernstein type rational functions of two variables and prove the approximation theorems for the derivatives of them.     

A generalized version of Branner-Hubbard conjecture for rational functions

In 1992, Branner and Hubbard raised a conjecture that the Julia set of a polynomial is a Cantor set if and only if each critical component of its filled-in Julia set is not periodic. This conjecture was solved recently. In this paper, we generalize this result to a class of rational functions.     

On the singularity probability of discrete random matrices

Let n be a large integer and Mn be an n by n complex matrix whose entries are independent (but not necessarily identically distributed) discrete random variables. The main goal of this paper is to prove a general upper bound for the probability that Mn is singular. For a constant 0<p<1 and a constant positive integer r, we will define a property p-bounded of exponent r. Our main result shows that if the entries of Mn satisfy this property, then the probability that Mn is singular is at most (p1/r+on(1)). All of the results in this paper hold for any characteristic zero integral domain replacing the complex numbers. In the special case where the entries of Mn are “fair coin flips” (taking the values +1,−1 each with probability 1/2), our general bound implies that the probability that Mn is singular is at most , improving on the previous best upper bound of , proved by Tao and Vu [Terence Tao, Van Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. 20 (2007) 603-628]. In the special case where the entries of Mn are “lazy coin flips” (taking values +1,−1 each with probability 1/4 and value 0 with probability 1/2), our general bound implies that the probability that Mn is singular is at most , which is asymptotically sharp. Our method is a refinement of those from [Jeff Kahn, János Komlós, Endre Szemerédi, On the probability that a random ±1-matrix is singular, J. Amer. Math. Soc. 8 (1) (1995) 223-240; Terence Tao, Van Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. 20 (2007) 603-628]. In particular, we make a critical use of the structure theorem from [Terence Tao, Van Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. 20 (2007) 603-628], which was obtained using tools from additive combinatorics.     

On the probability of having rational \ell-isogenies

We calculate the chance that an elliptic curve over a finite field has a specified number of -isogenies which emanate from it. We give a partial answer for abelian varieties of arbitrary dimension. Received: 20 September 2007     

On a generalized Hankel type convolution of generalized functions

The classical generalized Hankel type convolution are defined and extended to a class of generalized functions. Algebraic properties of the convolution are explained and the existence and significance of an identity element are discussed.     

Restricted domains,arrow-social welfare functions and noncorruptible and non-manipulable social choice correspondences: The case of private alternatives

An n-person social choice problem is considered in which the alternatives are n dimensional vectors, with the ith component of such a vector being the part of the alternatives affecting individual i alone. Assuming that individuals are selfish (individual i must be indifferent between any two alternatives with the same components), that they may be indifferent among alternatives and that each individual may choose his preferences out of a different set of permissible preferences, we prove that any set of restricted domains of preferences admits an n person non-dictatorial Arrow-type social welfare function if and only if it admits a two-person Arrow-type social welfare function: we characterize all the sets of restricted domains of preferences which admit two-person Arrow-type social welfare functions (and therefore also admit n-person Arrow-type social welfare functions) and then we prove that we also characterized all the sets of restricted domains of preferences which admit nondictatorial, nonmanipulable, noncorruptible and rational social choice correspondences.     

On integral estimates for the derivatives of rational functions

ПустьL - спрямляемая ж орданова дуга,? _n (L) - кла сс рациональных функци йR(z) степени ≦n,¦R(z)¦≦, zεL, $$\Lambda (n,L) = \mathop {\sup }\limits_{R(z)\varepsilon \Re _n (L)} \mathop \smallint \limits_L |R'(z)||dz|.$$ В работе получены нео бходимые и достаточн ые условия на дугуL, при которых в еличиныΛ(п, L), n=1, 2, ...конечны. При эти х условиях выполнены оценки: $$\Lambda (n,L) \leqq Cn^2 ,C = C(L) = const > 0.$$      

On the survival probability of generalized nearest-particle systems

A class of spatial growth models, including reversible nearest-particle systems as special cases, is defined via the range of an underlying random walk. Lower and upper bounds for the survival probability are established under various assumptions. The proofs rely on potential theoretic results for the random walk.     

On the Jensen-Steffensen inequality for generalized convex functions

Jensen-Steffensen type inequalities for P-convex functions and functions with nondecreasing increments are presented. The obtained results are used to prove a generalization of ?eby?ev’s inequality and several variants of Hölder’s inequality with weights satisfying the conditions as in the Jensen-Steffensen inequality. A few well-known inequalities for quasi-arithmetic means are generalized.     

On a variational method for univalent functions

In the paper, the construction of a variational method for univalent functions is suggested; this construction uses the factorization theorem. As a consequence, an analog of the Goluzin variational formula is obtained.     

On the approximation by rational combinations of a class of functions

() [0,1] — {(n)} — , +. , f(x) [0,1] () , x ₁ ,x ₂ [0, 1], (₁)=(₂), f(x ₁ )=f(x ₂ ).     

On the Nevanlinna-Pick interpolation problem for generalized stieltjes functions

The solutions of the Nevanlinna-Pick interpolation problem for generalized Stieltjes matrix functions are parametrized via a fractional linear transformation over a subset of the class of classical Stieltjes functions. The fractional linear transformation of some of these functions may have a pole in one or more of the interpolation points, hence not all Stieltjes functions can serve as a parameter. The set of excluded parameters is characterized in terms of the two related Pick matrices.Dedicated to the memory of M. G. Kreîn     

Discrete Dirac systems on the semiaxis: rational reflection coefficients and Weyl functions

We consider the cases of the self-adjoint and skew-self-adjoint discrete Dirac systems, obtain explicit expressions for reflection coefficients and show that rational reflection coefficients and Weyl functions coincide.     

On the existence of an arrow and a Bergson-Samuelson social welfare function

Let Σ be the set of all possible preferences over a given set of alternatives A. Let Ω be a proper subset of Σ and let P?Ωⁿ be a fixed profile of preferences. P is heterogeneous in Ω if for all a,b,c?A and Q?Ωⁿ, there exist three alternatives x,y,z?A such that Q(a,b,c)=P(x,y,z) where Q(B) denotes the subprofile over a set of alternatives B?A. An Arrow SWF ? is a function ?:Ωⁿ→Σ satisfying the conditions Pareto and IIA. A Bergson-Samuelson SWF is a function ?:P→Σ satisfying Pareto and Independence+Neutrality. The paper shows that (a) there exist a neutral nondictatorial Arrow SWF on Ω if and only if there exist a neutral nondictatorial Bergson-Samuelson SWF on P. (b) There exist a nondictatorial n person Bergson-Samuelson SWF on P if and only if there exists a 3 person Bergson-Samuelson SWF on P. (c) There exists a nondictatorial Arrow SWF on Ω if and only if there exists a nondictatorial Bergson-Samuelson SWF on P.