On a generalization of Minkowski's convex body theorem

Given a lattice $\text{Λ ? R}{}^{\mathrm{n}}$ and a bounded function g(x), x ∈ Rⁿ, vanishing outside of a bounded set, the functions ?(x)$\text{g}\text{?}\text{(x)?}$max_u∈Λg(u +x), ?(x)?Σ_{u∈Λ g(u +x)}, and ?₊(x)?Σ_u∈Λ max_{v∈Λ min {g(v + x); g(u + v + x)}} are defined and periodic mod Λ on Rⁿ. In the paper we prove that ?(x) + ?₊(x) ? 2?(x) ≥ ?(x) + h?₊(x) ? 2?(x) holds for all x ∈ Rⁿ, where h(x) is any “truncation” of g by a constant c ≥ 0, i.e., any function of the form h(x)?g(x) if g(x) ≤ c and h(x)?c if g(x) > c. This inequality easily implies some known estimations in the geometry of numbers due to Rado [1] and Cassels [2]. Moreover, some sharper and more general results are also derived from it. In the paper another inequality of a similar type is also proved.     

On a generalization of Albert’s theorem

It is proved by A. A. Albert that in an ordered division ring, any element algebraic over the center is central. In this paper, we shall investigate the following problem. LetD be an ordered division ring. Suppose every element inD is left algebraic over a maximal subfieldK. Does it follow thatD=K? We prove that the answers are affirmative in some cases.     

On the effectiveness of a generalization of Miller’s primality theorem

Berrizbeitia and Olivieri showed in a recent paper that, for any integer r$r$, the notion of ω$\omega$-prime to base a$a$ leads to a primality test for numbers n≡1$n\equiv 1$ mod r$r$, that under the Extended Riemann Hypothesis (ERH) runs in polynomial time. They showed that the complexity of their test is at most the complexity of the Miller primality test (MPT), which is O((logn)^4+o(1))$O\left({(logn)}^{4+o\left(1\right)}\right)$. They conjectured that their test is more effective than the MPT if r$r$ is large.     

On a generalization of a theorem of Erdős and Fuchs

Let A={a₁,a₂,…}(a₁<a₂<) be an infinite sequence of nonnegative integers, let k≥2 be a fixed integer and denote by r_k(A,n) the number of solutions of a_i1+a_i2++a_ik≤n. Montgomery and Vaughan proved that r₂(A,n)=cn+o(n^1/4) cannot hold for any constant c>0. In this paper, we extend this result to k>2.     

On a metric generalization of ramsey’s theorem

An increasing sequence of realsx=〈x _i :i<ω〉 is simple if all “gaps”x _i +1−x _i are different. Two simple sequencesx andy are distance similar ifx _i +1−x _i <x _j +1−x _j if and only ify _i +1−y _i <y _j +1−y _j for alli andj. Given any bounded simple sequencex and any coloring of the pairs of rational numbers by a finite number of colors, we prove that there is a sequencey distance similar tox all of whose pairs are of the same color. We also consider many related problems and generalizations. Partially supported by OTKA-4269. Partially supported by NSF grant STC-91-19999. Partially supported by OTKA-T-020914, NSF grant CCR-9424398 and PSC-CUNY Research Award 663472.     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

On a generalization of Rubin's theorem

The work is devoted to the calculation of asymptotic value of the choice number of the complete r‐partite graph K_{m* r} = K_{m, …, m} with equal part size m. We obtained the asymptotics in the case lnr = o(lnm). The proof generalizes the classical result of A.L. Rubin for the case r = 2. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 226–234, 2011 67: 226‐234, 2011     

A generalization of Dirichlet's unit theorem

In this paper, we obtain a unit theorem for algebraic tori defined over an algebraic number field, which generalizes Dirichlet's unit theorem as well as the S-unit theorem due to Hasse and Chevalley.     

On a generalization of the Gallai-Sylvester theorem

It is shown that ifS ^d , affS=aff ^d , and every hyperplane spanned by (a subset of)S misses fewer thank points ofS(k2), then (a) #Skm ifd=2m–1 is odd and (b) #Skm+1 ifd=2m is even. We also fully describe the extreme sets for which equality holds in (a) or in (b). For oddd the proofs are later modified to purely algebraic ones, and carry over to , where is an arbitrary field. For evend, (b) is generally not true when , but we prove some weaker inequalities that do hold over arbitrary fields.This is part of a Ph.D. thesis, supervised by Professor Micha A. Perles at the Hebrew University of Jerusalem. This research was supported in part by the Landau Center for Mathematical Research.     

On a generalization of the Keldysh theorem

The Keldysh theorem for an elliptic equation with characteristic parabolic degeneration is generalized for the case of an elliptic equation of the second-order canonical form with order and type degeneration. The criteria under which the Dirichlet or Keldysh problems are correct are given in a one-sided neighborhood of the degeneration segment, enabling one to write the criteria in a single form. Moreover, some cases are pointed out in which it is even nessesary to give a criterion in the neighborhood because it is impossible to establish it on the segment of degeneracy of the equation.     

On a generalization of a theorem of Lyapunov

A constructive and simple proof is given of a generalization of a result of Lyapunov on the convexity of the range of vector measure.     

On generalization of Menshoff's theorem

The condition providing the analyticity for continuous locally univalent functions of complex variables is established. This generalizes the classical Menshoff result on homeomorphic mappings preserving infinitestimal circles.