On the Discrepancy for Boxes and Polytopes

 We consider so-called Tusnády’s problem in dimension d: Given an n-point set P in R ^d , color the points of P red or blue in such a way that for any d-dimensional interval B, the number of red points in differs from the number of blue points in by at most Δ, where should be as small as possible. We slightly improve previous results of Beck, Bohus, and Srinivasan by showing that , with a simple proof. The same asymptotic bound is shown for an analogous problem where B is allowed to be any translated and scaled copy of a fixed convex polytope A in R ^d . Here the constant of proportionality depends on A and we give an explicit estimate. The same asymptotic bounds also follow for the Lebesgue-measure discrepancy, which improves and simplifies results of Beck and of Károlyi.     

On the Discrepancy for Boxes and Polytopes

 We consider so-called Tusnády’s problem in dimension d: Given an n-point set P in R ^d , color the points of P red or blue in such a way that for any d-dimensional interval B, the number of red points in differs from the number of blue points in by at most Δ, where should be as small as possible. We slightly improve previous results of Beck, Bohus, and Srinivasan by showing that , with a simple proof. The same asymptotic bound is shown for an analogous problem where B is allowed to be any translated and scaled copy of a fixed convex polytope A in R ^d . Here the constant of proportionality depends on A and we give an explicit estimate. The same asymptotic bounds also follow for the Lebesgue-measure discrepancy, which improves and simplifies results of Beck and of Károlyi. Received 17 November 1997; in revised form 30 July 1998     

On weighted positivity and the Wiener regularity of a boundary point for the fractional Laplacian

A sufficient condition for the Wiener regularity of a boundary point with respect to the operator (− Δ)^μ inR ⁿ ,n≥1, is obtained, for μ∈(0,1/2n)/(1,1/2n−1). This extends some results for the polyharmonic operator obtained by Maz'ya and Maz'ya-Donchev. As in the polyharmonic case, the proof is based on a weighted positivity property of (− Δ)^μ, where the weight is a fundamental solution of this operator. It is shown that this property holds for μ as above while there is an interval [A _n , 1/2n−A _n ], whereA _n →1, asn→∞, with μ-values for which the property does not hold. This interval is non-empty forn≥8.     

Operator algebras and a theorem of Dieudonne

LetA be aC*-algebra with second dualA″. Let (φ _n)(n=1,...) be a sequence in the dual ofA such that limφ _n(a) exists for eacha εA. In general, this does not imply that limφ _n(x) exists for eachx εA″. But if limφ _n(p) exists whenever p is the range projection of a positive self-adjoint element of the unit ball ofA, then it is shown that limφ _n(x) does exist for eachx inA″. This is a non-commutative generalisation of a celebrated theorem of Dieudonné. A new proof of Dieudonné’s theorem, for positive measures, is given here. The proof of the main result makes use of Dieudonné’s original theorem.     

Computing the Euler characteristic of generalized Kummer varieties

We give an elementary proof of the formula χ(K ⁿ A)=n ³σ(n) for the Euler characteristic of the generalized Kummer variety K ⁿ A, where σ(n) denotes the sum of divisors function.     

On Rich Lines in Grids

In this paper we show that if one has a grid A×B, where A and B are sets of n real numbers, then there can be only very few “rich” lines in certain quite small families. Indeed, we show that if the family has lines taking on n ^ε distinct slopes, and where each line is parallel to n ^ε others (so, at least n ^2ε lines in total), then at least one of these lines must fail to be “rich”. This result immediately implies non-trivial sumproduct inequalities; though, our proof makes use of the Szemeredi-Trotter inequality, which Elekes used in his argument for lower bounds on |C+C|+|C.C|.     

Analytic proof of the partition identity A 5,3,3(n)=B 5,3,3 0 (n)

In this paper we give an analytic proof of the identity A _5,3,3(n)=B _5,3,3⁰(n), where A _5,3,3(n) counts the number of partitions of n subject to certain restrictions on their parts, and B _5,3,3⁰(n) counts the number of partitions of n subject to certain other restrictions on their parts, both too long to be stated in the abstract. Our proof establishes actually a refinement of that partition identity. The original identity was first discovered by the first author jointly with M. Ruby Salestina and S.R. Sudarshan in [Proceedings of the International Conference on Analytic Number Theory with Special Emphasis on L-functions, Ramanujan Math. Soc., Mysore, 2005, pp. 57–70], where it was also given a combinatorial proof, thus answering a question of Andrews. Research partially supported by EC’s IHRP Programme, grant HPRN-CT-2001-00272, “Algebraic Combinatorics in Europe.”     

The factorization of the permanent of a matrix with minimal rank in prime characteristic

It is known that any square matrix A of size n over a field of prime characteristic p that has rank less than n/(p − 1) has a permanent that is zero. We give a new proof involving the invariant X _p . There are always matrices of any larger rank with non-zero permanents. It is shown that when the rank of A is exactly n/(p − 1), its permanent may be factorized into two functions involving X _p .     

An Improvement to “A Note on Euclidean Ramsey Theory”

We characterize those subsets Y⊆ℝ ⁿ such that for every infinite X⊆ℝ ⁿ , there is a red/blue coloring of ℝ ⁿ having no monochromatic red set similar to X and no monochramtic blue set similar to Y.     

On the maximal number of solutions of a problem in linear inequalities

The problemy=Ax+c,x≧0,y≧0, (x, y)=0 is considered, where the square real matrixA and the real vectorc are the data and a solution is a pair of vectorsx, y. Under certain conditions on the matrixA there exists a solution for every vectorc, but it cannot be unique for everyc. We prove that under these conditions the maximal number of solutions is 2 ⁿ − 1.     

Primitive systems of elements in the varieties A m A n : Criterion and inducing

LetA _n, n≥0, be a variety of all Abelian groups whose exponental divides n. We establish a criterion of being primitive for varieties of the formA _m A _n, and study into the question of inducing primitive systems of elements in free groups of these. The results obtained give a solution to the problem by Bachmuth and Mochizuki concerning the tame range of varietiesA _m A _n for the case where m is freed of squares, and lend support to the conjecture by Bryant and Gupta as to inducing primitive, systems for varieties likeA _pnA. This author’s part is supported by RFFR grant No. 99-01-00567. Translated fromAlgebra i Logika, Vol. 38, No. 5, pp. 513–530, September–October, 1999.     

Logarithmic density and measures on semigroups

Davenport and Erdős [3] proved that every setA of integers with the property thata ∈A impliesan ∈A for alln (multiplicative ideal) has a logarithmic density. I generalized [5] this result to sets with the property that if for some numbersa, b, n we havea ∈ A, b ∈ A andan ∈ A, then necessarilybn ∈ A, which I call quasi-ideals. Here a new proof of this theorem is given, applying a result on convolution of measures on discretes semigroups. This leads to further generalizations, including an improvement of a result of Warlimont [8] on ideals in abstract arithmetic semigroups. Supported by Hungarian National Foundation for Scientific Research, Grant No. 1901     

Permutation groups,simple groups,and sieve methods

We show that the number of integersn≤x which occur as indices of subgroups of nonabelian finite simple groups, excluding that ofA _n−1 inA _n , is ∼hx/logx, for some given constanth. This might be regarded as a noncommutative analogue of the Prime Number Theorem (which counts indicesn≤x of subgroups of abelian simple groups). We conclude that for most positive integersn, the only quasiprimitive permutation groups of degreen areS _n andA _n in their natural action. This extends a similar result for primitive permutation groups obtained by Cameron, Neumann and Teague in 1982. Our proof combines group-theoretic and number-theoretic methods. In particular, we use the classification of finite simple groups, and we also apply sieve methods to estimate the size of some interesting sets of primes. Research partially supported by the Australian Research Council for C.E.P. and by the Bi-National Science Foundation United States-Israel Grant 2000-053 for A.S.     

Quadratically normal and congruence-normal matrices

A matrix A ∈ C ^n×n is unitarily quasidiagonalizable if A can be brought by a unitary similarity transformation to a block diagonal form with 1 × 1 and 2 × 2 diagonal blocks. In particular, the square roots of normal matrices, i.e., the so-called quadratically normal matrices are unitarily quasidiagonalizable. A matrix A ∈ C ^n×n is congruence-normal if B = A[`(A)] B = A\overline A is a conventional normal matrix. We show that every congruence-normal matrix A can be brought by a unitary congruence transformation to a block diagonal form with 1 × 1 and 2 × 2 diagonal blocks. Our proof emphasizes andexploitsalikenessbetween theequations X <sup>2</sup> = B and X[`(X)] = B X\overline X = B for a normal matrix B. Bibliography: 13 titles.     

NON-EMPTY CROSS-2-INTERSECTING FAMILIES OF SUBSETS

Let Cdenote the set of all k-subests of an n-set.Assume Alohtain in Ca,and A lohtain in (A,B) is called a cross-2-intersecting family if |A B≥2 for and A∈A,B∈B.In this paper,the best upper bounds of the cardinalities for non-empty cross-2-intersecting familles of a-and b-subsets are obtained for some a and b,A new proof for a Frankl-Tokushige theorem[6] is also given.     

On the matricial version of Fermat–Euler congruences

The congruences modulo the primary numbers n=p ^a are studied for the traces of the matrices A ⁿ and A ^n-φ(n), where A is an integer matrix and φ(n) is the number of residues modulo n, relatively prime to n. We present an algorithm to decide whether these congruences hold for all the integer matrices A, when the prime number p is fixed. The algorithm is explicitly applied for many values of p, and the congruences are thus proved, for instance, for all the primes p ≤ 7 (being untrue for the non-primary modulus n=6). We prove many auxiliary congruences and formulate many conjectures and problems, which can be used independently. Partially supported by RFBR, grant 05-01-00104. An erratum to this article is available at .     

The Dirichlet series for the exterior square <Emphasis Type="Italic">L</Emphasis>-function on GL(<Emphasis Type="Italic">n</Emphasis>)

We present an elementary derivation of the Jacquet–Shalika construction for the exterior square L-function on GL(n), as a classical Dirichlet series in the Fourier coefficients A(m ₁,…,m _n−1).     

Inversion of matrices over a pseudocomplemented lattice

We compute the greatest solutions of systems of linear equations over a lattice (P, ≤). We also present some applications of the results obtained to lattice matrix theory. Let (P, ≤) be a pseudocomplemented lattice with and and let A = ‖a _ij ‖ _n×n , where a _ij ∈ P for i, j = 1,..., n. Let A* = ‖a _ij ^′ ‖ _n×n and for i, j = 1,..., n, where a* is the pseudocomplement of a ∈ P in (P, ≤). A matrix A has a right inverse over (P, ≤) if and only if A · A* = E over (P, ≤). If A has a right inverse over (P, ≤), then A* is the greatest right inverse of A over (P, ≤). The matrix A has a right inverse over (P, ≤) if and only if A is a column orthogonal over (P, ≤). The matrix D = A · A* is the greatest diagonal such that A is a left divisor of D over (P, ≤). Invertible matrices over a distributive lattice (P, ≤) form the general linear group GL _n (P, ≤) under multiplication. Let (P, ≤) be a finite distributive lattice and let k be the number of components of the covering graph Γ(join(P,≤) − , ≤), where join(P, ≤) is the set of join irreducible elements of (P, ≤). Then GL _a (P, ≤) ≅ = S _n ^k . We give some further results concerning inversion of matrices over a pseudocomplemented lattice. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 3, pp. 139–154, 2005.     

Packing up to 50 Equal Circles in a Square

The problem of maximizing the radius of n equal circles that can be packed into a given square is a well-known geometrical problem. An equivalent problem is to find the largest distance d, such that n points can be placed into the square with all mutual distances at least d. Recently, all optimal packings of at most 20 circles in a square were exactly determined. In this paper, computational methods to find good packings of more than 20 circles are discussed. The best packings found with up to 50 circles are displayed. A new packing of 49 circles settles the proof that when n is a square number, the best packing is the square lattice exactly when n≤ 36. Received April 24, 1995, and in revised form June 14, 1995.     

The triadjoint of an orthosymmetric bimorphism

Let A and B be two Archimedean vector lattices and let (A′)′ _n and (B′)′ _n be their order continuous order biduals. If Ψ: A × A → B is a positive orthosymmetric bimorphism, then the triadjoint Ψ***: (A′)′ _n × (A′)′ _n → (B′)′ _n of Ψ is inevitably orthosymmetric. This leads to a new and short proof of the commutativity of almost f-algebras.