Numerical Semigroups on Compound Sequences

We generalize the geometric sequence {a^p, a^p?1b, a^p?2b²,…, b^p} to allow the p copies of a (resp. b) to all be different. We call the sequence {a₁a₂a₃… a_p, b₁a₂a₃…a_p, b₁b₂a₃…a_p,…, b₁b₂b₃…b_p} a compound sequence. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Apéry sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.     

Robust estimation in the linear model with asymmetric error distributions

In the linear model X^{n × 1} = C^{n × p}θ^{p × 1} + E^{n × 1}, Huber's theory of robust estimation of the regression vector θ^{p × 1} is adapted for two models for the partially specified common distribution F of the i.i.d. components of the error vector E^{n × 1}. In the first model considered, the restriction of F to a set [−a₀, b₀] is a standard normal distribution contaminated, with probability , by an unknown distribution symmetric about 0. In the second model, the restriction of F to [−a₀, b₀] is completely specified (and perhaps asymmetrical). In both models, the distribution of F outside the set [−a₀, b₀] is completely unspecified. For both models, consistent and asymptotically normal M-estimators of θ^{p × 1} are constructed, under mild regularity conditions on the sequence of design matrices {C^{n × p}}. Also, in both models, M-estimators are found which minimize the maximal mean-squared error. The optimal M-estimators have influence curves which vanish off compact sets.     

Characterization of generalized convex functions by their best approximation in sign-monotone norms

Let {u₀, u₁,… u_{n − 1}} and {u₀, u₁,…, u_n} be Tchebycheff-systems of continuous functions on [a, b] and let f ε C[a, b] be generalized convex with respect to {u₀, u₁,…, u_{n − 1}}. In a series of papers ([1], [2], [3]) D. Amir and Z. Ziegler discuss some properties of elements of best approximation to f from the linear spans of {u₀, u₁,…, u_{n − 1}} and {u₀, u₁,…, u_n} in the L_p-norms, 1 p ∞, and show (under different conditions for different values of p) that these properties, when valid for all subintervals of [a, b], can characterize generalized convex functions. Their methods of proof rely on characterizations of elements of best approximation in the L_p-norms, specific for each value of p. This work extends the above results to approximation in a wider class of norms, called “sign-monotone,” [6], which can be defined by the property: ¦ f(x)¦ ¦ g(x)¦,f(x)g(x) 0, a x b, imply f g . For sign-monotone norms in general, there is neither uniqueness of an element of best approximation, nor theorems characterizing it. Nevertheless, it is possible to derive many common properties of best approximants to generalized convex functions in these norms, by means of the necessary condition proved in [6]. For {u₀, u₁,…, u_n} an Extended-Complete Tchebycheff-system and f ε C⁽ⁿ⁾[a, b] it is shown that the validity of any of these properties on all subintervals of [a, b], implies that f is generalized convex. In the special case of f monotone with respect to a positive function u₀(x), a converse theorem is proved under less restrictive assumptions.     

Three-monotone spline approximation

For r≥3, n∈N and each 3-monotone continuous function f on [a,b] (i.e., f is such that its third divided differences [x₀,x₁,x₂,x₃]f are nonnegative for all choices of distinct points x₀,…,x₃ in [a,b]), we construct a spline s of degree r and of minimal defect (i.e., s∈C^r−1[a,b]) with n−1 equidistant knots in (a,b), which is also 3-monotone and satisfies ‖f−s‖_L∞[a,b]≤cω₄(f,n⁻¹,[a,b])_∞, where ω₄(f,t,[a,b])_∞ is the (usual) fourth modulus of smoothness of f in the uniform norm. This answers in the affirmative the question raised in [8, Remark 3], which was the only remaining unproved Jackson-type estimate for uniform 3-monotone approximation by piecewise polynomial functions (ppfs) with uniformly spaced fixed knots.Moreover, we also prove a similar estimate in terms of the Ditzian–Totik fourth modulus of smoothness for splines with Chebyshev knots, and show that these estimates are no longer valid in the case of 3-monotone spline approximation in the L_p norm with p<∞. At the same time, positive results in the L_p case with p<∞ are still valid if one allows the knots of the approximating ppf to depend on f while still being controlled.These results confirm that 3-monotone approximation is the transition case between monotone and convex approximation (where most of the results are “positive”) and k-monotone approximation with k≥4 (where just about everything is “negative”).     

Extremal problems for linear orders on [n] p

Let be a product order on [n] ^p i.e. for A, B [n] ^p , 1a ₁<a ₂<...<a _p º-n and 1<-b ₁<b ₂<...<b _p <-n we have AB iff a _i<-b _i for all i=1, 2,..., p. For a linear extension < of (ordering [n] ^p as ) let F _< ^[n],p (m) count the number of A _i 's, i<-m such that 1A _i. Clearly, for every m and <, where <l denotes the lexicographic order on [n] ^p . In this note we prove that the colexicographical order, <c, provides a corresponding lower bound i.e. that holds for any linear extension < of .This project together with [2] was initiated by the first author and continued in colaboration with the second author. After the death of the first author the work was continued and finalized by the second and the third author.Research supported by NSF grant DMS 9011850.     

Finite non-elementary abelian p-groups whose number of subgroups is maximal

Assume G is a direct product of M _p (1, 1, 1) and an elementary abelian p-group, where M _p (1, 1, 1) = 〈a, b | a ^p = b ^p = c ^p =1, [a,b]=c,[c,a] = [c,b]=1〉. When p is odd, we prove that G is the group whose number of subgroups is maximal except for elementary abelian p-groups. Moreover, the counting formula for the groups is given.     

On the embedding problem with non-Abelian kernel of orderp 4. V

A survey of solvability conditions for the embedding problem of number fields, in which the kernel is a non-Abelian group of order p⁴, is completed. As a kernel, the two 2-groups with two generators a, b and with the following relations are considered: a ⁸ =1, b ² =1, [a,b]=a⁻² in the first group, and a ⁸ =1, b ² =a ⁴ , [a,b]=a⁻² in the second. Bibliography: 7 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 211, 1994, pp. 127–132. Translated by V. V. Ishkhanov.     

Proof of Oppenheim's area inequalities for triangles and quadrilaterals

Leta ₁,b ₁,c ₁,A ₁ anda ₂,b ₂,c ₂,A ₂ be the sides and areas of two triangles. Ifa=(a ₁ ^p +a ₂ ^p )^1/p ,b=(b ₁ ^p +b ₂ ^p )^1/p ,c=(c ₁ ^p +c ₂ ^p )^1/p , and 1p4, thena, b, c are the sides of a triangle and its area satisfiesA ^p/2A ₁ ^p/2 +A ₂ ^p/2 . If obtuse triangles are excluded,p>4 is allowed. For convex cyclic quadrilaterals, a similar inequality holds. Also, leta, b, c, A be the sides and area of an acute or right triangle. Iff(x) satisfies certain conditions,f(a),f(b),f(c) are the sides of a triangle having areaA _f, which satisfies (4A _f/3)^1/2f((4A/3)^1/2).     

Semigroups with magnifiers admitting minimal subsemigroups

An element a of a semigroup S is a left magnifier if λ_a, the inner left translation associated with a, is surjective and is not injective (E. S. Ljapin [11]). When this happens there exists a proper subset M of S such that the restriction to M of λ_a is bijective. In that case M is said to be a minimal subset for the left magnifier a (F. Migliorini [13], [14], [15]). Remark that if S is a semigroup having left identities then every left magnifier of S admits minimal subsets which are right ideals. Characterisations for semigroups with left magnifiers which also contain left identities have been given by E. S. Ljapin and R. Desq, using the bicyclic monoid. The general problem, precisely to give a characterization of semigroups having left magnifiers, is still open.     

[a,b]-factorizations of graphs

Let a and b be integers with b ? a ? 0. A graph G is called an [a,b]-graph if a ? d_G(v) ? b for each vertex v ∈ V(G), and an [a,b]-factor of a graph G is a spanning [a,b]-subgraph of G. A graph is [a,b]-factorable if its edges can be decomposed into [a,b]-factors. The purpose of this paper is to prove the following three theorems: (i) if 1 ? b ? 2a, every [(12a + 2)m + 2an,(12b + 4)m + 2bn]-graph is [2a, 2b + 1]-factorable; (ii) if b ? 2a ?1, every [(12a ?4)m + 2an, (12b ?2)m + 2bn]-graph is [2a ?1,2b]-factorable; and (iii) if b ? 2a ?1, every [(6a ?2)m + 2an, (6b + 2)m + 2bn]-graph is [2a ?1,2b + 1]-factorable, where m and n are nonnegative integers. They generalize some [a,b]-factorization results of Akiyama and Kano [3], Kano [6], and Era [5].     

Divisibility among power GCD matrices and among power LCM matrices on three coprime divisor chains

Let h be a positive integer and S?=?{x ₁,?…?,?x _h } be a set of h distinct positive integers. We say that the set S is a divisor chain if x _σ(1) ∣?…?∣ x _σ(h) for a permutation σ of {1,?…?,?h}. If the set S can be partitioned as S?=?S ₁?∪?S ₂?∪?S ₃, where S ₁, S ₂ and S ₃ are divisor chains and each element of S _i is coprime to each element of S _j for all 1?≤?i?<?j?≤?3, then we say that the set S consists of three coprime divisor chains. The matrix having the ath power (x _i , x _j ) ^a of the greatest common divisor of x _i and x _j as its i, j-entry is called the ath power greatest common divison (GCD) matrix on S, denoted by (S ^?a ). The ath power least common multiple (LCM) matrix [S ^?a ] can be defined similarly. In this article, let a and b be positive integers and let S consist of three coprime divisor chains with 1?∈?S. We show that if a?∣?b, then the ath power GCD matrix (S ^?a ) (resp., the ath power LCM matrix [S ^?a ]) divides the bth power GCD matrix (S ^?b ) (resp., the bth power LCM matrix [S ^?b ]) in the ring M _h (Z) of h?×?h matrices over integers. We also show that the ath power GCD matrix (S ^?a ) divides the bth power LCM matrix [S ^?b ] in the ring M _h (Z) if a?∣?b. However, if a???b, then such factorizations are not true. Our results extend Hong's and Tan's theorems and also provide further evidences to the conjectures of Hong raised in 2008.     

Invariant means

Let m and M be symmetric means in two and three variables, respectively. We say that M is type 1 invariant with respect to m if M(m(a,c),m(a,b),m(b,c))≡M(a,b,c). If m is strict and isotone, then we show that there exists a unique M which is type 1 invariant with respect to m. In particular, we discuss the invariant logarithmic mean L₃, which is type 1 invariant with respect to L(a,b)=(b−a)/(logb−loga). We say that M is type 2 invariant with respect to m if M(a,b,m(a,b))≡m(a,b). We also prove existence and uniqueness results for type 2 invariance, given the mean M(a,b,c). The arithmetic, geometric, and harmonic means in two and three variables satisfy both type 1 and type 2 invariance. There are means m and M such that M is type 2 invariant with respect to m, but not type 1 invariant with respect to m (for example, the Lehmer means). L₃ is type 1 invariant with respect to L, but not type 2 invariant with respect to L.     

Strongly Singular Sturm – Liouville Problems

We consider a Sturm – Liouville operator Lu = —(r(t)u′)′ + p (t)u , where r is a (strictly) positive continuous function on ]a, b [ and p is locally integrable on ]a, b[. Let r₁(t) = (1/r) ds andchoose any c ∈]a, b[. We are interested in the eigenvalue problem Lu = λm(t)u, u (a) = u (b) = 0,and the corresponding maximal and anti .maximal principles, in the situation when 1/r ∈ L¹ (a, c),1 /r ∉ L¹ (c, b), pr₁ ∉ L¹ (a, c) and pr₁ ∉ L¹(c, b).     

Remainder estimates for the approximation numbers of weighted Hardy operators acting onL 2

We consider the weighted Hardy integral operatorT:L ²(a, b) →L ²(a, b), −∞≤a<b≤∞, defined by . In [EEH1] and [EEH2], under certain conditions onu andv, upper and lower estimates and asymptotic results were obtained for the approximation numbersa _n(T) ofT. In this paper, we show that under suitable conditions onu andv, where ∥w∥_p=(∫ _a ^b |w(t)|^p dt)^1/p. Research supported by NSERC, grant A4021. Research supported by grant No. 201/98/P017 of the Grant Agency of the Czech Republic.     

A problem of P. Seymour on nonbinary matroids

The following statement fork=1, 2, 3 has been proved by Tutte [4], Bixby [1] and Seymour [3] respectively: IfM is ak-connected non-binary matroid andX a set ofk-1 elements ofM, thenX is contained in someU ₄ ² minor ofM. Seymour [3] asks whether this statement remains true fork=4; the purpose of this note is to show that it does not and to suggest some possible alternatives. Supported in part by the National Science Foundation     

Recursive method for building Arnold’s triangle X p (a,b)

We give a recursive method for building X _p (a,b) for each prime p. Arnold’s triangle is composed of positive integers: for a>1 and 0<b<a, X _p (a,b) is the degree of the highest power of p dividing the difference of the binomial coefficients C _pa ^pb −C _a ^b .      

On voronoi diagrams in theL p-metric in ℝD

We prove upper bounds on the number ofL _p-spheres passing throughD+1 points in general position in ℝ”, and on the sum of the Betti numbers of the intersection of bisectors in theL _p-metric, wherep is an even positive integer. The bounds found do not depend onp. Our result implies that the complexity of Voronoi diagrams (for point sites in general position) in theL _p-metric is bounded for increasingp. The proof for this upper bound involves the techniques of Milnor [12] and Thom [16] for finding a bound on the sum of the Betti numbers of algebraic varieties, but instead of the usual degree of polynomials we use their additive complexity, and apply results of Benedetti and Risler [2], [13]. Furthermore, we prove that inD dimensions and for evenp the number ofL _p-spheres passing throughD+1 points in general position is odd. In particular, combined with results of [8], [9], our results clarify the structure of Voronoi diagrams based on theL _p-metric (with evenp) in three dimensions. For the proof we use the theory of degree of continuous mappings in ℝ^D, which is a tool widely applied in nonlinear analysis [14]. This work was partially supported by Deutsche Forschungsgemeinschaft, Grant K1 655/2-1. A preliminary version of this paper was presented at the 11th Annual Symposium on Theoretical Aspects of Computer Science, France, 1994.