The symmetric group given by a Gröbner basis

We present a Gröbner basis associated with the symmetric group of degree n, which is determined by a strong generating set of the symmetric group and is defined by means of a term ordering with the elimination property.     

Answers to two questions posed by Farhi concerning additive bases

Let A be an asymptotic basis for N and X a finite subset of A such that A?X is still an asymptotic basis. Farhi recently proved a new batch of upper bounds for the order of A?X in terms of the order of A and a variety of parameters related to the set X. He posed two questions concerning possible improvements to his bounds. In this note, we answer both questions.     

Representation of elements of a sequence by sumsets

In this note the method of [5] and a result from [3] are combined to treat the following classical problem: Given a finite setA and an infinite sequenceS (both inZ), what is the minimal number of elements ofA whose sum lies inS? We obtain an upper bound depending only on the densities ofA andS (but not on their arithmetic nature).     

Supersequences, rearrangements of sequences, and the spectrum of bases in additive number theory

The set of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be represented as the sum of h elements of A. If an∼αnh for some real number α>0, then α is called an additive eigenvalue of order h. The additive spectrum of order h is the set N(h) consisting of all additive eigenvalues of order h. It is proved that there is a positive number ηh?1/h! such that N(h)=(0,ηh) or N(h)=(0,ηh]. The proof uses results about the construction of supersequences of sequences with prescribed asymptotic growth, and also about the asymptotics of rearrangements of infinite sequences. For example, it is proved that there does not exist a strictly increasing sequence of integers such that bn∼n² and B contains a subsequence such that bnk∼k³.     

Upper bounds of a stabilizer order for linear finite-dimensional systems

The problem of stabilizing linear dynamic systems by a stabilizer (a dynamic system) is considered. The upper bounds of a stabilizer order obtained using two Hidenori Kimura results are studied. The bound k ₀ is shown to be better than the bounds k ₁ and k ₂ only in one case. In addition, all possible relations between three bounds k ₀, k ₁, and k ₂ are proven to be realized in the space of parameters of observability and controllability indices, i.e., there is a dynamic system with the respective observability and controllability indices.     

Sharp bounds for the number of roots of univariate fewnomials

Let K be a field and t?0. Denote by Bm(t,K) the supremum of the number of roots in K^?, counted with multiplicities, that can have a non-zero polynomial in K[x] with at most t+1 monomial terms. We prove, using an unified approach based on Vandermonde determinants, that Bm(t,L)?t²Bm(t,K) for any local field L with a non-archimedean valuation v:L→R∪{∞} such that vZ≠0_|≡0 and residue field K, and that Bm(t,K)?(t²−t+1)(pf−1) for any finite extension K/Qp with residual class degree f and ramification index e, assuming that p>t+e. For any finite extension K/Qp, for p odd, we also show the lower bound Bm(t,K)?(2t−1)(pf−1), which gives the sharp estimation Bm(2,K)=3(pf−1) for trinomials when p>2+e.     

Representing powers of 2 by a sum of four integers

We solve an arithmetic problem due to Erdös and Freud (1986) investigated also by Freiman, Nathanson and Sárközy: How many elements from a given set of integers one must take to represent a power of 2 by their sum?     

The n-generator property in rings of integer-valued polynomials determined by finite sets

Let D be an integral domain and E a non-empty finite subset of D. For n ≧ 2, we show that D has the n-generator property if and only if Int(E, D) has the n-generator property if and only if Int(E, D) has the strong (n + 1)-generator property. Thus, iterating the Int(E, D) construction cannot produce Prüfer domains whose finitely generated ideals require an ever larger number of generators. We also show that, for n ≧ 2, a non-zero polynomial f ∈Int(E, D) is a strong n-generator in Int(E, D) if and only if f (a) is a strong n-generator in D for all a ∈E. Received: 15 July 2004     

Quantifying the error of convex order bounds for truncated first moments

The concepts of convex order and comonotonicity have become quite popular in risk theory, essentially since Kaas et al. [Kaas, R., Dhaene, J., Goovaerts, M.J., 2000. Upper and lower bounds for sums of random variables. Insurance: Math. Econ. 27, 151-168] constructed bounds in the convex order sense for a sum S of random variables without imposing any dependence structure upon it. Those bounds are especially helpful, if the distribution of S cannot be calculated explicitly or is too cumbersome to work with. This will be the case for sums of lognormally distributed random variables, which frequently appear in the context of insurance and finance.In this article we quantify the maximal error in terms of truncated first moments, when S is approximated by a lower or an upper convex order bound to it. We make use of geometrical arguments; from the unknown distribution of S only its variance is involved in the computation of the error bounds. The results are illustrated by pricing an Asian option. It is shown that under certain circumstances our error bounds outperform other known error bounds, e.g. the bound proposed by Nielsen and Sandmann [Nielsen, J.A., Sandmann, K., 2003. Pricing bounds on Asian options. J. Financ. Quant. Anal. 38, 449-473].     

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form un=an(n+t)+b with (a,t,b)∈Z³, a?5, t?0, gcd(a,b)=1. From this, we deduce for instance the lower bound: lcm{¹²+1,²²+1,…,n²+1}?0,32n(1,442) (for all n?1). In the last part of this article, we study the integer lcm(n,n+1,…,n+k) (k∈N, n∈N^∗). We show that it has a divisor dn,k simple in its dependence on n and k, and a multiple mn,k also simple in its dependence on n. In addition, we prove that both equalities: lcm(n,n+1,…,n+k)=dn,k and lcm(n,n+1,…,n+k)=mn,k hold for an infinitely many pairs (n,k).     

Sumsets Containing Powers of an Integer

Let n1, and let m be an integer with m2. We show that if a subset A of the interval [0,n] satisfies that 0A and |A|>1+n/2, then mA, the set of the sum of m (not necessarily distinct) elements in A, has a power of m. This result is best possible in the case that m is odd.     

On additive inequalities for intermediate derivatives of functions given on a finite interval

We present a general scheme for deducing additive inequalities of Landau-Hadamard type. As a consequence, we prove several new inequalities for the norms of intermediate derivatives of functions given on a finite interval with an exact constant with the norm of a function.     

Density of sets of natural numbers and the Lévy group

Let N denote the set of positive integers. The asymptotic density of the set A⊆N is d(A)=limn→∞|A∩[1,n]|/n, if this limit exists. Let AD denote the set of all sets of positive integers that have asymptotic density, and let SN denote the set of all permutations of the positive integers N. The group L^? consists of all permutations f∈SN such that A∈AD if and only if f(A)∈AD, and the group L^* consists of all permutations f∈L^? such that d(f(A))=d(A) for all A∈AD. Let be a one-to-one function such that d(f(N))=1 and, if A∈AD, then f(A)∈AD. It is proved that f must also preserve density, that is, d(f(A))=d(A) for all A∈AD. Thus, the groups L^? and L^* coincide.     

Error bounds for an isolated eigenvalue obtained by the Galerkin method

This paper contains error estimates for approximate eigenvalues of closed operators obtained by a Galerkin method. There is an example.

---

Zusammenfassung Für die durch ein Galerkin-Verfahren erhaltenen approximativen Eigenwerte eines abgeschlossenen Operators wird eine Fehlerabschätzung gegeben. Die Resultate werden durch ein Beispiel illustriert.

---

---

In memory of Professor Eduard Stiefel (1909–1978)     

An expression for the number of subgroups of a given order of a finite p-group

We find an exact expression for the number of subgroups of any (possible) order of an arbitrary finite p-group.Translated from Matematicheskie Zametki, Vol. 12, No. 5, pp. 561–568, November, 1972.