Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

Large-Deviation Local Theorem for Additive Functionals of a Markov Gaussian Field. I

We prove a local limit theorem (LLT) on Cramer-type large deviations for sums S _V = _t V ( _t ), where _t , t Z , 1, is a Markov Gaussian random field, V Z , and is a bounded Borel function. We get an estimate from below for the variance of S _V and construct two classes of functions , for which the LLT of large deviations holds.     

Packing random items of three colors

Consider three colors 1,2,3, and forj3, considern items (X _i,j)in of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X _i,jj)in,j3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted spaceK logn with overwhelming probability.Work partially supported by an N.S.F. grant.     

Configuration of subgroups in the special linear group over a skew field with infinite center

Let T be a skew field with infinite center, let be the special linear group over T of degree 3, and let be the subgroup of diagonal matrices with unit Dieudonee determinant. It is proved that for each intermediate subgroup H, H , there exists a net of order n such that ( H N().Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 175, pp. 5–12, 1989.In conclusion, the author would like to thank his instructor Z. I. Borevich, as well as N. A. Vavilov, for their assistance.     

On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function

Summary We study a class of generalized gamma functions _k (z) which relate to the generalized Euler constants _k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for _k is derived, and the constant term in the asymptotic expansion for log _k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.     

Montgomery's weighted sieve for dimension two

The most well-known application of Montgomery's weighted sieve is to the so-called Brun-Titchmarsh inequality, which was proved byH. L. Montgomery andR. C. Vaughan in the form (x, k, l)2x((k)log(x/k))^–1 for 1k<x, (k, l)=1, (x, k, l) being the number of primespx andpl modk, (k) being Euler's function. In this paper an upper estimate is given for a certain class of two-dimensional sieve problems, among them bounds for the number of twin primes and the number of Goldbach representations.     

On measures that agree on balls

The fundamental result: if and v are two finite Borel measures, defined in the spaceL ^p[0, 1] (1p<) or in C(K) (K is a metric compactum without isolated points), then from the equalities (B)=v(B) for all balls B of radius 1 there follows that =v. In addition, in the spaces C(K) and _p (1p<) from the inequalities (B) v(B) there follows that v.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 177, pp. 122–128, 1989.     

Method for symmetrization and estimation of solutions of the Neumann problem for the equation of a porous medium in domains with noncompact boundary for infinitely increasing time

We consider the initial boundary-value Neumann problem for the equation of a porous medium in a domain with noncompact boundary. By using a symmetrization method, we obtain exactL _p-estimates, 1p, for solutions as t.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 2, pp. 147–157, February, 1995.     

On Large Values of the Divisor Function

Let d(n) denote the divisor function, and let D(X) denote the maximal value of d(n) for n X. For 0 < z 1, both lower and upper bounds are given for the number of integersn with n X, zD(X) d(n).     

Sukzessive Minima mit und ohne Nebenbedingungen

Given semi-normsf andg on ⁿ and a real number >0. Then the successive minima off under the constraintg are defined by _j : = inf {: there existj linear independent vectors inZ ⁿ withf andg}. The main theorem of this paper (Lagrange multiplier theorem) states that the successive minima of a certainnorm h on ⁿ (without constraints) coincide with the _j 's up to bounded factors. Moreover, this norm is constructed explicitly. Using Minkowski's wellknown theorem on successive minima and our result certain inequalities on simultaneous Diophantine approximations are derived.     

Densest packings of eleven congruent circles in a circle

In 1969 Pirl provided the densest packings ofn equal circles in a circle forn 10. We will prove the optimality for the packings that were conjectured forn=11. The proof is based on elementary combinatorial and analytical techniques.     

Survival of Threshold Contact Processes

We consider the d-dimensional threshold contact process. Suppose that a vacant site becomes occupied at rate one when there are at least occupied sites in its neighborhood, and the death rate at any site is >0. We will explicitly give two integers ab with the following properties: For a the process survives starting from finite configurations when is small, but for >a the process dies out starting from any finite configuration with any positive death rate. For b the process has a nontrivial invariant measure when is small, but for >b the only invariant measure is the all-zero configuration for any positive death rate.     

Improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set

We will establish the following improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set: For each k and d, 0 k d, define f(d,k) = d+1 if k = 0 and f(d,k) = max{d+1,2d–2k+2} if 1 k d.Theorem 1. Let S be a compact, connected, locally starshaped set in R^d, S not convex. Then for a k with 0 k d, dim ker S k if and only if every f(d, k) lnc points of S are clearly visible from a common k-dimensional subset of S.Theorem 2. Let S be a nonempty compact set in R^d. Then for a k with 0 k d, dim ker S k if and only if every f (d, k) boundary points of S are clearly visible from a common k-dimensional subset of S. In each case, the number f(d, k) is best possible for every d and k.     

The Maximum Box Problem and its Application to Data Analysis

Given two finite sets of points X ⁺ and X ^– in ⁿ , the maximum box problem consists of finding an interval (box) B = {x : l x u} such that B X ^– = , and the cardinality of B X ⁺ is maximized. A simple generalization can be obtained by instead maximizing a weighted sum of the elements of B X ⁺. While polynomial for any fixed n, the maximum box problem is -hard in general. We construct an efficient branch-and-bound algorithm for this problem and apply it to a standard problem in data analysis. We test this method on nine data sets, seven of which are drawn from the UCI standard machine learning repository.     

The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.     

Eine Bemerkung zu den höheren Pythagoraszahlen reeller Körper

Becker has shown in [1] that for the 4-th Pythagoras number of the field (X) the inequality P₄ ((X)) 36 holds. In this paper we will show P₄ ((X)) 24 and P₄ (K) 3 for all real pythagorean fields K.     

Some functionals over a compact Minkovskii space

In this paper we obtain estimates which are order-exact for the projection and Macphail constants of an arbitrary n-dimensional Banach space: 1(X)n, 1/n₁(X)1/n.Translated from Matematicheskii Zametki, Vol. 10, No. 4, pp. 453–457, 1971.     

Einschliessungsaussagen für Differentialoperatoren vierter Ordnung und ein Verfahren zur Berechnung von Schrankenfunktionen

For a linear fourth order ordinary differential operator M we study Range Domain Implications (RDI). Let C_o [O,1] be positive; we show under what conditions there exists a C_O[O,1] such that the following RDI holds: Mu(x) (x) (0x1) u(x) (0x1). In particular we provide a numerical procedure to calculate .RDI are used to obtain error estimations and to solve related nonlinear problems.The basic idea to prove RDI is to split M into a product of second order differential operators which are easier to handle. For the general case that there exists no global splitting the concept of a local splitting is introduced.

---

---

The author would like to thank the European Research Office of the United States Army for their kind interest.     

Rational chebyshev approximations of elementary functions

Explicit formulæ which should be useful in practical computations, are given for the functions e^–x, log x, (1 + x), arctg x/x, sin x/x, cos x and (2/x) arcsin (x/2) in the interval 0x1 except for log x, where the interval is 1/2x1 instead.     

Moser-type inequalities in Lorentz spaces

Moser-type estimates for functions whose gradient is in the Lorentz space L(n, q), 1q, are given. Similar results are obtained for solutions uH _inf0 ^sup1 of Au=(f _i ) _{x i} , where A is a linear elliptic second order differential operator and |f|L(n, q), 2q.Work partially supported by MURST (40%).