The spectrum of a commutator Hamiltonian is hydrogenlike

For any finite group, an element (commutator Hamiltonian) is defined in its group algebra so that in any representation of that group the image of this element is diagonalizable and has the spectrum contained in the set {1/n ²|n = 1,2,3,…}. The result is generalized onto an arbitrary compact group. In particular, it is pointed out that for the natural representation of the group SU(2, C) in the space of complex-valued functions with the square of absolute values integrable over the Haar measure the multiplicity of the eigenvalue 1/n ² of the commutator Hamiltonian is equal to n ².     

Differential operators for Siegel-Jacobi forms

For any positive integers n and m, H_(n,m):= H_n× C~(m,n) is called the Siegel-Jacobi space, with the Jacobi group acting on it. The Jacobi forms are defined on this space. We compute the Chern connection of the Siegel-Jacobi space and use it to obtain derivations of Jacobi forms. Using these results, we construct a series of invariant differential operators for Siegel-Jacobi forms. Also two kinds of Maass-Shimura type differential operators for H_(n,m) are obtained.     

On the torus cobordant cohomology spheres

Let G be a compact Lie group. In 1960, P A Smith asked the following question: “Is it true that for any smooth action of G on a homotopy sphere with exactly two fixed points, the tangent G-modules at these two points are isomorphic?” A result due to Atiyah and Bott proves that the answer is ‘yes’ for ? _p and it is also known to be the same for connected Lie groups. In this work, we prove that two linear torus actions on S ⁿ which are c-cobordant (cobordism in which inclusion of each boundary component induces isomorphisms in ?-cohomology) must be linearly equivalent. As a corollary, for connected case, we prove a variant of Smith’s question.     

The normalizers of free subgroups in free burnside groups of odd period <Emphasis Type="Italic">n ≥</Emphasis> 1003

Let B(m, n) be a free periodic group of arbitrary rank m with period n. In this paper, we prove that for all odd numbers n ≥ 1003 the normalizer of any nontrivial subgroup N of the group B(m, n) coincides with N if the subgroup N is free in the variety of all n-periodic groups. From this, there follows a positive answer for all prime numbers n > 997 to the following problem set by S. I. Adian in the Kourovka Notebook: is it true that none of the proper normal subgroups of the group B(m, n) of prime period n > 665 is a free periodic group? The obtained result also strengthens a similar result of A. Yu. Ol’shanskii by reducing the boundary of exponent n from n > 10⁷⁸ to n ≥ 1003. For primes 665 < n ≤ 997, the mentioned question is still open.     

On conjectures of Minkowski and Woods for <Emphasis Type="BoldItalic">n</Emphasis> = 9

Let ?ⁿ be the n-dimensional Euclidean space with O as the origin. Let ∧ be a lattice of determinant 1 such that there is a sphere |X| < R which contains no point of ∧ other than O and has n linearly independent points of ∧ on its boundary. A well known conjecture in the geometry of numbers asserts that any closed sphere in ?ⁿ of radius \( \sqrt {n/4}\) contains a point of ∧. This is known to be true for n≤8. Here we prove a more general conjecture of Woods for n = 9 from which this conjecture follows in ?⁹. Together with a result of McMullen (J. Amer. Math. Soc.18 (2005) 711–734), the long standing conjecture of Minkowski follows for n = 9.     

Maximum Distance Between Slater Orders and Copeland Orders of Tournaments

Given a tournament T?=?(X, A), we consider two tournament solutions applied to T: Slater’s solution and Copeland’s solution. Slater’s solution consists in determining the linear orders obtained by reversing a minimum number of directed edges of T in order to make T transitive. Copeland’s solution applied to T ranks the vertices of T according to their decreasing out-degrees. The aim of this paper is to compare the results provided by these two methods: to which extent can they lead to different orders? We consider three cases: T is any tournament, T is strongly connected, T has only one Slater order. For each one of these three cases, we specify the maximum of the symmetric difference distance between Slater orders and Copeland orders. More precisely, thanks to a result dealing with arc-disjoint circuits in circular tournaments, we show that this maximum is equal to n(n???1)/2 if T is any tournament on an odd number n of vertices, to (n ²???3n?+?2)/2 if T is any tournament on an even number n of vertices, to n(n???1)/2 if T is strongly connected with an odd number n of vertices, to (n ²???3n???2)/2 if T is strongly connected with an even number n of vertices greater than or equal to 8, to (n ²???5n?+?6)/2 if T has an odd number n of vertices and only one Slater order, to (n ²???5n?+?8)/2 if T has an even number n of vertices and only one Slater order.     

Isometric embeddings of finite metric spaces

It is proved that there exists a metric on a Cantor set such that any finite metric space whose diameter does not exceed 1 and the number of points does not exceed n can be isometrically embedded into it. It is also proved that for any m, n ∈ N there exists a Cantor set in R^m that isometrically contains all finite metric spaces which can be embedded into R^m, contain at most n points, and have the diameter at most 1. The latter result is proved for a wide class of metrics on R^m and, in particular, for the Euclidean metric.     

On the Strong <Emphasis Type="Italic">n</Emphasis>-partite Tournaments with Exactly Two Cycles of Length <Emphasis Type="Italic">n</Emphasis> − 1

Gutin and Rafiey (Australas J. Combin. 34 (2006), 17-21) provided an example of an n-partite tournament with exactly n ? m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question. Let 3 ≤ m ≤ n and n ≥ 4. Are there strong n-partite tournaments, which are not themselves tournaments, with exactly n ? m + 1 cycles of length m for two values of m? In the same paper, they showed that this question has a negative answer for two values n ? 1 and n. In this paper, we prove that a strong n-partite tournament with exactly two cycles of length n ? 1 must contain some given multipartite tournament as subdigraph. As a corollary, we also show that the above question has a negative answer for two values n ? 1 and any l with 3 ≤ l ≤ n and l ≠ n ? 1.     

Subtended angles

Suppose that d ≥ 2 and m are fixed. For which n is it the case that any n angles can be realised by placing m points in R^d?     

Complex vector measure and integral over manifolds with locally finite variations

It is well known that any compactly supported continuous complex differential n-form can be integrated over real n-dimensional C¹ manifolds in C^m (m ≥ n). For n = 1, the integral along any locally rectifiable curve is defined. Another generalization is the theory of currents (linear functionals on the space of compactly supported C^∞ differential forms). The topic of the article is the integration of measurable complex differential (n, 0)-forms (containing no \(d{\bar z_j}\)) over real n-dimensional C⁰ manifolds in C^m with locally finite n-dimensional variations (a generalization of locally rectifiable curves to dimensions n > 1). The last result is that a real n-dimensional manifold C¹ embedded in C^m has locally finite variations, and the integral of a measurable complex differential (n, 0)-form defined in the article can be calculated by a well-known formula.     

Arithmetic Progressions in Linear Combinations of <Emphasis Type="Italic">S</Emphasis>-Units

M. Pohst asked the following question: is it true that every prime can be written in the form 2^u ± 3^v with some non-negative integers u, v? We put the problem into a general framework, and prove that the length of any arithmetic progression in t-term linear combinations of elements from a multiplicative group of rank r (e.g. of S-units) is bounded in terms of r, t, n, where n is the number of the coefficient t-tuples of the linear combinations. Combining this result with a recent theorem of Green and Tao on arithmetic progressions of primes, we give a negative answer to the problem of M. Pohst.     

On Substructure Densities of Hypergraphs

A real number α ∈ [0, 1) is a jump for an integer r ≥ 2 if there exists c > 0 such that for any ∈ > 0 and any integer m ≥ r, there exists an integer n ₀ such that any r-uniform graph with n > n ₀ vertices and density ≥ α + ∈ contains a subgraph with m vertices and density ≥ α + c. It follows from a fundamental theorem of Erdös and Stone that every α ∈ [0, 1) is a jump for r = 2. Erdös also showed that every number in [0, r!/r ^r ) is a jump for r ≥ 3 and asked whether every number in [0, 1) is a jump for r ≥ 3 as well. Frankl and Rödl gave a negative answer by showing a sequence of non-jumps for every r ≥ 3. Recently, more non-jumps were found for some r ≥ 3. But there are still a lot of unknowns on determining which numbers are jumps for r ≥ 3. The set of all previous known non-jumps for r = 3 has only an accumulation point at 1. In this paper, we give a sequence of non-jumps having an accumulation point other than 1 for every r ≥ 3. It generalizes the main result in the paper ‘A note on the jumping constant conjecture of Erdös’ by Frankl, Peng, Rödl and Talbot published in the Journal of Combinatorial Theory Ser. B. 97 (2007), 204–216.     

Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts

An exclusive-OR sum of pseudoproducts (ESPP) is a modufo-2 sum of products of affine (linear) Boolean functions. The length of an ESPP is defined as the number of summands in this sum; the length of a Boolean function in the class of ESPPs is the minimum length of an ESPP representing this function. The Shannon length function L ^ESPP(n) on the set of Boolean functions in the class of ESPPs is considered; it is defined as the maximum length of a Boolean function of n variables in the class of ESPPs. It is proved that L ^ESPP(n) = ? (2 ⁿ /n ²). The quantity L ^ESPP(n) also equals the least number l such that any Boolean function of n variables can be represented as a modulo-2 sum of at most l multiaffine functions.     

Some variations on Tverberg’s theorem

Define T(d, r) = (d + 1)(r - 1) + 1. A well known theorem of Tverberg states that if n ≥ T(d, r), then one can partition any set of n points in R^d into r pairwise disjoint subsets whose convex hulls have a common point. The numbers T(d, r) are known as Tverberg numbers. Reay added another parameter k (2 ≤ k ≤ r) and asked: what is the smallest number n, such that every set of n points in R^d admits an r-partition, in such a way that each k of the convex hulls of the r parts meet. Call this number T(d, r, k). Reay conjectured that T(d, r, k) = T(d, r) for all d, r and k. In this paper we prove Reay’s conjecture in the following cases: when k ≥ [d+3/2], and also when d < rk/r-k - 1. The conjecture also holds for the specific values d = 3, r = 4, k = 2 and d = 5, r = 3, k = 2.     

A class of constacyclic codes over a finite field-II

Let \(\mathbb{F}_q\) be a finite field with q = p ^m elements, where p is any prime and m ≥ 1. In this paper, we explicitly determine all the μ-constacyclic codes of length ? ⁿ over \(\mathbb{F}_q\), where ? is an odd prime coprime to p and the order of μ is a power of ?. All the repeated-root λ- constacyclic codes of length ? ⁿ p ^s over \(\mathbb{F}_q\) are also determined for any nonzero λ in \(\mathbb{F}_q\). As examples all the λ-constacyclic codes of length 3 ⁿ p ^s over \(\mathbb{F}_q\) for p = 5, 7, 11, 19 for n ≥ 1, s ≥ 1 are derived. We also obtain all the self-orthogonal negacyclic codes of length ? ⁿ over \(\mathbb{F}_q\) when q is odd prime power and give some illustrative examples.     

Asymptotic behavior of zeros of Mittag-Leffler functions of order 1/2

Let z _n denote the sequence of zeros of the Mittag-Leffler function E _ρ (z; μ), ρ > 0, μ ∈ ?, which is an entire function of order ρ. With the exception of the case ρ = 1/2, Re μ = 3 an asymptotic behavior of the sequence z _n ^ρ was known earlier up to infinitesimals o(1) having a sharply defined rate of decrease. In this paper the behavior of the sequence z _n ^1/2 is studied just in this exceptional case. Furthermore, for ρ = 1/2, μ > 3 we give the form of a curvilinear half-plane which is free of the points z _n .     

On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

On an Extremal Problem for Poset Dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) = n ^1/2. We improve the best known upper bound and show f(n) = O (n ^2/3). For higher dimensions, we show \(f_{d}(n)=\O \left (n^{\frac {d}{d + 1}}\right )\), where f _d (n) is the largest integer such that every poset on n elements has a d-dimensional subposet on f _d (n) elements.     

A tournament approach to pattern avoiding matrices

We consider the following Turán-type problem: given a fixed tournament H, what is the least integer t = t(n,H) so that adding t edges to any n-vertex tournament, results in a digraph containing a copy of H. Similarly, what is the least integer t = t(T _n ,H) so that adding t edges to the n-vertex transitive tournament, results in a digraph containing a copy of H. Besides proving several results on these problems, our main contributions are the following:

• Pach and Tardos conjectured that if M is an acyclic 0/1 matrix, then any n × n matrix with n(log n) ^O(1) entries equal to 1 contains the pattern M. We show that this conjecture is equivalent to the assertion that t(T _n ,H) = n(log n) ^O(1) if and only if H belongs to a certain (natural) family of tournaments.
• We propose an approach for determining if t(n,H) = n(log n) ^O(1). This approach combines expansion in sparse graphs, together with certain structural characterizations of H-free tournaments. Our result opens the door for using structural graph theoretic tools in order to settle the Pach–Tardos conjecture.

     

Hilbert boundary value problem in the weighted spaces <Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>(<Emphasis Type="Italic">ρ</Emphasis>)

The paper studies a Hilbert boundary value problem in L ¹(ρ), where ρ(t) = |1–t|^α and α is a real number. For α > ?1, it is proved that the homogeneous problem has n + κ linearly independent solutions when n + κ ≥ 0, where a(t) is the coefficient of the problem, besides, κ ind a(t) and n = [α] + 1 if α is not an integer, and n = α if α is an integer. Conditions under which the problem is solvable are found for the case when α > ?1 and n+κ < 0. For α ≤ ?1 the number of linearly independent solutions of the homogeneous problem depends on the behavior of the function a(t) at the point t = 1.