On the generalized critical values of a polynomial mapping

 Let be a polynomial dominant mapping and let deg f _i ≤d. We prove that the set K(f) of generalized critical values of f is contained in the algebraic hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ , where . This implies in particular that the set B(f) of bifurcations points of f is contained in the hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ . We give also an algorithm to compute the set K(f) effectively. Received: 11 June 2001 / Revised version: 1 July 2002 Published online: 24 January 2003 The author is partially supported by the KBN grant 2 PO3A 017 22. Mathematics Subject Classification (2000): 14D06, 14Q20, 51N10, 51N20, 15A04     

Asymptotics of the Best Polynomial Approximation of?|x|p and?of?the Best Laurent Polynomial Approximation of sgn(x) on Two Symmetric Intervals

We present a new method that allows us to get a direct proof of the classical Bernstein asymptotics for the error of the best uniform polynomial approximation of |x| ^p on two symmetric intervals. Note that, in addition, we get asymptotics for the polynomials themselves under a certain renormalization. Also, we solve a problem on asymptotics of the best approximation of sgn(x) on [−1,−a]∪[a,1] by Laurent polynomials.      

Lower bounds to helly numbers of line transversals to disjoint congruent balls

A line ℓ is a transversal to a family F of convex objects in ℝ ^d if it intersects every member of F. In this paper we show that for every integer d ⩾ 3 there exists a family of 2d−1 pairwise disjoint unit balls in ℝ ^d with the property that every subfamily of size 2d − 2 admits a transversal, yet any line misses at least one member of the family. This answers a question of Danzer from 1957. Crucial to the proof is the notion of a pinned transversal, which means an isolated point in the space of transversals. Here we investigate minimal pinning configurations and construct a family F of 2d−1 disjoint unit balls in ℝ ^d with the following properties: (i) The space of transversals to F is a single point and (ii) the space of transversals to any proper subfamily of F is a connected set with non-empty interior.     

The gonality of smooth curves with plane models

LetC be the normalization of an integral plane curve of degreed with δ ordinary nodes or cusps as its singularities. If δ=0, then Namba proved that there is no linear seriesg _d ^−2/1 and that everyg _d ^−1/1 is cut out by a pencil of lines passing through a point onC. The main purpose of this paper is to generalize his result to the case δ>0. A typical one is as follows: Ifd≥2(k+1), and δ<kd−(k+1)²+3 for somek>0, thenC has no linear seriesg _d ^−3/1 . We also show that ifd≥2k+3 and δ<kd−(k+1)²+2, then each linear seriesg _d ^−2/1 onC is cut out by a pencil of lines. We have similar results forg _d ^−1/1 andg _2d ^−9/1 . Furthermore, we also show that all of our theorems are sharp.     

Multiple points of trajectories of multiparameter fractional Brownian motion

Consider 0<α<1 and the Gaussian process Y(t) on ℝ ^N with covariance E(Y(s)Y(t))=|t|^2α+|s|^2α−|t−s|^2α, where |t| is the Euclidean norm of t. Consider independent copies X ¹,…,X ^d of Y and␣the process X(t)=(X ¹(t),…,X ^d (t)) valued in ℝ ^d . When kN≤␣(k−1)αd, we show that the trajectories of X do not have k-multiple points. If N<αd and kN>(k−1)αd, the set of k-multiple points of the trajectories X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^{k N /α−( k −1) d} (loglog(1/ɛ)) ^k . If N=αd, we show that the set of k-multiple points of the trajectories of X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^d (log(1/ɛ) logloglog 1/ɛ) ^k . (This includes the case k=1.) Received: 20 May 1997 / Revised version: 15 May 1998     

Reciprocal polynomials with all zeros on the unit circle

Let f(x)=a _d x ^d +a _d−1 x ^d−1+⋅⋅⋅+a ₀∈ℝ[x] be a reciprocal polynomial of degree d. We prove that if the coefficient vector (a _d ,a _d−1,…,a ₀) or (a _d−1,a _d−2,…,a ₁) is close enough, in the l ¹-distance, to the constant vector (b,b,…,b)∈ℝ ^d+1 or ℝ ^d−1, then all of its zeros have moduli 1.     

On the Minimum Length of some Linear Codes of Dimension 5

In this paper, we shall prove that the minimum length n_q(5,d) is equal to g_q(5,d) +1 for q⁴−2q²−2q+1≤ d≤ q⁴ − 2q² − q and 2q⁴ − 2q³ − q² − 2q+1 ≤ d ≤ 2q⁴−2q³−q²−q, where g_q(5,d) means the Griesmer bound . Communicated by: J.D. Key     

Cycles with a given number of vertices from each partite set in regular multipartite tournaments

If x is a vertex of a digraph D, then we denote by d ⁺(x) and d ⁻(x) the outdegree and the indegree of x, respectively. A digraph D is called regular, if there is a number p ∈ ℕ such that d ⁺(x) = d ⁻(x) = p for all vertices x of D. A c-partite tournament is an orientation of a complete c-partite graph. There are many results about directed cycles of a given length or of directed cycles with vertices from a given number of partite sets. The idea is now to combine the two properties. In this article, we examine in particular, whether c-partite tournaments with r vertices in each partite set contain a cycle with exactly r − 1 vertices of every partite set. In 1982, Beineke and Little [2] solved this problem for the regular case if c = 2. If c ⩾ 3, then we will show that a regular c-partite tournament with r ⩾ 2 vertices in each partite set contains a cycle with exactly r − 1 vertices from each partite set, with the exception of the case that c = 4 and r = 2.     

Asymptotics of the density matrix for a system of a large number of identical particles

The Wigner equation is considered for a system of a large numberN of identical particles with interaction factor of the order of 1/N. In both the Bose and the Fermi cases, we construct the asymptotics of the solution of the Cauchy problem for this equation with regard to the exchange effect for the case in which the Planck constant is of the order ofN ^−1/d , whered is the space dimension. This asymptotics is interpreted in terms of the theory of the complex germ on a curved phase space equivalent to the space of functions with values on the Riemann sphere in the Fermi case and on the Lobachevskii plane in the Bose case. The classical equations of motion in both cases are reduced to the Vlasov equation; since the phase space is infinite-dimensional, the complex germ is subjected to additional conditions depending on the type of statistics. Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 84–106, January, 1999.     

Properties of complete sets of mutually equiorthogonal frequency hypercubes

A complete set of mutually equiorthogonal frequency hypercubes (MEFH) of ordern and dimensiond, usingm distinct symbols, has (n−1) ^d /(m−1) hypercubes. In this article, we explore the properties of complete sets of MEFH. As a consequence of these properties, we show that existence of such a set implies that the number of symbolsm is a prime power. We also establish an equivalence between existence of a complete set of MEFH and existence of a certain complete set of Latin hypercubes and a certain complete orthogonal array.     

On the generation of clones containing near-unanimity operations

It is a well-known consequence of the Baker-Pixley-Theorem that any clone containing a near-unanimity operation is finitely generated, leading to the question what arity the generating functions must have. In this paper, we show that, for arbitrary d ≥ 2 and large enough n, (n − 1) ^d − 1 is the smallest integer k such that, for every clone C on an n-element set that contains a (d + 1)-ary near-unanimity operation, C ^(k) generates C.     

ALMOST EQUIDISTANT POINTS ON S D-1

Let S ^d-1 denote the (d − 1)-dimensional unit sphere centered at the origin of the d-dimensional Euclidean space. Let 0 < α < π. A set P of points in S ^d-1 is called almost α-equidistant if among any three points of P there is at least one pair lying at spherical distance α. In this note we prove upper bounds on the cardinality of P depending only on d. This revised version was published online in August 2006 with corrections to the Cover Date.     

A class of optimal linear codes of length one above the Griesmer bound

In this paper, we determine the smallest lengths of linear codes with some minimum distances. We construct a [g _q (k, d) + 1, k, d] _q code for sq ^k-1 − sq ^k-2 − q ^s  − q ² + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s with 3 ≤ s ≤ k − 2 and q ≥ s + 1. Then we get n _q (k, d) = g _q (k, d) + 1 for (k − 2)q ^k-1 − (k − 1)q ^k-2 − q ² + 1 ≤ d ≤ (k − 2)q ^k-1 − (k − 1)q ^k-2, k ≥ 6, q ≥ 2k − 3; and sq ^k-1 − sq ^k-2 − q ^s  − q + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s , s ≥ 2, k ≥ 2s + 1 and q ≥ 2s − 1. This work was partially supported by the Com²MaC-SRC/ERC program of MOST/KOSEF (grant ^# R11-1999-054) and was partially supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2005-214-C00175).     

Extensions of the D(?k2)-triples {k2, k2 ± 1, 4k2 ± 1}

Let n be a nonzero integer. A set of m distinct positive integers is called a D(n)-m-tuple if the product of any two of them increased by n is a perfect square. Let k be a positive integer. In this paper, we show that if {k ², k ² + 1, 4k ² + 1, d} is a D(−k ²)-quadruple, then d = 1, and that if {k ² − 1, k ², 4k ² − 1, d} is a D(k ²)-quadruple, then d = 8k ²(2k ² − 1).     

An elementary proof of Tverberg’s theorem

A new proof is suggested for Tverberg’s familiar theorem saying that an arbitrary set of q: (d + 1)(p − 1) + 1 points in ℝ ^d can be split into p parts such that their convex hulls have a nonempty intersection. Bibliography: 9 titles.     

Discrete spectrum of the perturbed Dirac operator

In this paper we study the asymptotics of the discrete spectrum in the gap (−1, 1) of the perturbed Dirac operatorD(α)=D ₀−αV1 acting inL ₂(R ³;C ⁴) with large coupling constant α. In particular some “non-standard” asymptotic formulae are obtained.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Near optimal bounds for the Erdős distinct distances problem in high dimensions

We show that the number of distinct distances in a set of n points in ℝ ^d is Ω(n ^{2/d − 2 / d(d + 2)}), d ≥ 3. Erdős’ conjecture is Ω(n ^2/d ).     

Properties of the Flows Generated by Stochastic Equations with Reflection

We consider the properties of a random set ϕ _t (ℝ ₊ ^d ), where ϕ _t (x) is a solution of a stochastic differential equation in ℝ ₊ ^d with normal reflection from the boundary that starts from a point x. We characterize inner and boundary points of the set ϕ _t (ℝ ₊ ^d ) and prove that the Hausdorff dimension of the boundary ∂ϕ _t (ℝ ₊ ^d ) does not exceed d − 1. __________ Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 57, No. 8, pp. 1069 – 1078, August, 2005.     

Kinetic Spanners in ℝ<Superscript><Emphasis Type="Italic">d</Emphasis></Superscript>

We present a new (1+ε)-spanner for sets of n points in ℝ ^d . Our spanner has size O(n/ε ^d−1) and maximum degree O(log  ^d n). The main advantage of our spanner is that it can be maintained efficiently as the points move: Assuming that the trajectories of the points can be described by bounded-degree polynomials, the number of topological changes to the spanner is O(n ²/ε ^d−1), and using a supporting data structure of size O(nlog  ^d n), we can handle events in time O(log  ^d+1 n). Moreover, the spanner can be updated in time O(log n) if the flight plan of a point changes. This is the first kinetic spanner for points in ℝ ^d whose performance does not depend on the spread of the point set.