Discretization and resolution of the (<Emphasis Type="Italic">r</Emphasis>|<Emphasis Type="Italic">X</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>)-medianoid problem involving quality criteria

In this paper an extension of the (r|X _p )-medianoid on networks introduced by Hakimi (1983) is studied. In this extension the customer considers not only the distance but some characteristics of the facilities such as store size, quality of service and parking space. A new firm wants to establishr new facilities which have to compete with thep facilities that already exist in the market. The entry firm wants to find their locations and characteristics to maximize profits. Three different customer choice rules (binary, partially binary and proportional preferences) are considered. Some discretization results are obtained and a resolution procedure is proposed. The problem is solved combining a global search algorithm based on a branch and bound procedure with some combinatorial heuristics (greedy, interchange, and tabu search). Some computational experiences are presented. Partially supported by Ministerio de Ciencia y Tecnología (Spain) and FEDER, grant BFM2002-04525-C02-01.     

Minimax estimation of the mean of spherically symmetric distributions under general quadratic loss

For X one observation on a p-dimensional (p ≥ 4) spherically symmetric (s.s.) distribution about θ, minimax estimators whose risks dominate the risk of X (the best invariant procedure) are found with respect to general quadratic loss, L(δ, θ) = (δ − θ)′ D(δ − θ) where D is a known p × p positive definite matrix. For C a p × p known positive definite matrix, conditions are given under which estimators of the form δ_a,r,C,D(X) = (I − (ar(|X|²)) D^−1/2CD^1/2 |X|⁻²)X are minimax with smaller risk than X. For the problem of estimating the mean when n observations X₁, X₂, …, X_n are taken on a p-dimensional s.s. distribution about θ, any spherically symmetric translation invariant estimator, δ(X₁, X₂, …, X_n), with have a s.s. distribution about θ. Among the estimators which have these properties are best invariant estimators, sample means and maximum likelihood estimators. Moreover, under certain conditions, improved robust estimators can be found.     

The symmetric (2k,k)‐graphs

A noncomplete graph G is called an (n, k)‐graph if it is n‐connected and G − X is not (n − |X| + 1)‐connected for any X ⊆ V(G) with |X| ≤ k. Mader conjectured that for k ≥ 3 the graph K_{2k + 2} − (1‐factor) is the unique (2k, k)‐graph. We settle this conjecture for strongly regular graphs, for edge transitive graphs, and for vertex transitive graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 35–51, 2001     

A Lower Bound of <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> Norms in the CLT for Strongly Mixing Random Variables

We derive a lower bound of L _p norms, 1 ⩽ p ⩽ ∞, in the central limit theorem for strongly mixing random variables X ₁,..., X _n with under the boundedness condition ℙ{|X _i | ⩽ M} = 1 with a nonrandom constantM > 0 and condition ∑ _r⩾1 r ²α(r) < ∞, where α(r) are the Rosenblatt strong mixing coefficients. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 587–602, October–December, 2005.     

An almost sure invariance principle for trimmed sums of random vectors

Let {X _n ; n ≥ 1} be a sequence of independent and identically distributed random vectors in ℜ ^p with Euclidean norm |·|, and let X _n ^(r) = X _m if |X _m | is the r-th maximum of {|X _k |; k ≤ n}. Define S _n = Σ _k≤n X _k and ^(r) S _n − (X _n ⁽¹⁾ + ... + X _n ^(r)). In this paper a generalized strong invariance principle for the trimmed sums ^(r) S _n is derived.     

Clarkson and Random Clarkson Inequalities for Lr(X)

We first show how (p,p′) Clarkson inequality for a Banach space X is inherited by Lebesgue-Bochner spaces L_r(X), which extends Clarkson's procedure deriving his inequalities for L_p from their scalar versions. Fairly many previous and new results on Clarkson's inequalities, and also those on Rademacher type and cotype at the same time (by a recent result of the authors), are obtained as immediate consequences. Secondly we show that if the (p, p') Clarkson inequality holds in X, then random Clarkson inequalities hold in L_r(X) for any 1 ≤ r ≤ ∞; the converse is true if r = p'. As corollaries the original Clarkson and random Clarkson inequalities for L_p are both directly derived from the parallelogram law for scalars.     

On <Emphasis Type="Bold">(c,p)</Emphasis>-pseudostable Random Variables

In (Oleszkiewicz, Lecture Notes in Math. 1807), K. Oleszkiewicz defined a p-pseudostable random variable X as a symmetric random variable for which the following equation holds:

A note on a conjecture of Borwein and Choi

A polynomial P(X) with coefficients {ǃ} of odd degree N - 1 is cyclotomic if and only if¶¶P(X) = ±F_p1 (±X)F_p2(±X^p1) ?F_pr(±X^{p1 p2 ?p_r-1}) P(X) = \pm \Phi_{p1} (\pm X)\Phi_{p2}(\pm X^{p1}) \cdots \Phi_{p_r}(\pm X^{p1 p2 \cdots p_r-1}) ¶where N = p₁ p₂ · · · p_r and the p_i are primes, not necessarily distinct, and where F_p(X) : = (X^p - 1) / (X - 1) \Phi_{p}(X) := (X^{p} - 1) / (X - 1) is the p-th cyclotomic polynomial. This is a conjecture of Borwein and Choi [1]. We prove this conjecture for a class of polynomials of degree N - 1 = 2^r p^l - 1 N - 1 = 2^{r} p^{\ell} - 1 for any odd prime p and for integers r, l\geqq 1 r, \ell \geqq 1 .     

Consistency of a recursive nearest neighbor regression function estimate

Let (X, Y) be an ^d × -valued random vector and let (X₁, Y₁),…,(X_N, Y_N) be a random sample drawn from its distribution. Divide the data sequence into disjoint blocks of length l₁, …, l_n, find the nearest neighbor to X in each block and call the corresponding couple (X_i^*, Y_i^*). It is shown that the estimate m_n(X) = Σ_{i = 1}ⁿ w_niY_i^*/Σ_{i = 1}ⁿ w_ni of m(X) = E{Y|X} satisfies E{|m_n(X) − m(X)|^p} 0 (p ≥ 1) whenever E{|Y|^p} < ∞, l_n ∞, and the triangular array of positive weights {w_ni} satisfies sup_{i ≤ n}w_ni/Σ_{i = 1}ⁿ w_ni 0. No other restrictions are put on the distribution of (X, Y). Also, some distribution-free results for the strong convergence of E{|m_n(X) − m(X)|^p|X₁, Y₁,…, X_N, Y_N} to zero are included. Finally, an application to the discrimination problem is considered, and a discrimination rule is exhibited and shown to be strongly Bayes risk consistent for all distributions.     

Exponential bounds of mean error for the kernel estimates of regression functions

Let (X, Y), (X₁, Y₁), …, (X_n, Y_n) be i.d.d. R^r × R-valued random vectors with E|Y| < ∞, and let Q_n(x) be a kernel estimate of the regression function Q(x) = E(Y|X = x). In this paper, we establish an exponential bound of the mean deviation between Q_n(x) and Q(x) given the training sample Zⁿ = (X₁, Y₁, …, X_n, Y_n), under conditions as weak as possible.     

Half‐transitive graphs of valency 4 with prescribed attachment numbers

A graph X is said to be ½‐transitive if its automorphism group Aut X acts vertex‐ and edge‐, but not arc‐transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so‐called alternating cycles, that is even length cycles in X whose every other vertex is the head and every other vertex is the tail of its two incident edges in the above orientation. All alternating cycles have the same length 2r(X), where r(X) is the radius of X, and any two adjacent alternating cycles intersect in the same number of vertices, called the attachment number a(X) of X. All known examples of ½‐transitive graphs have attachment number 1, r or 2r, where r is the radius of the graph. In this article, we construct ½‐transitive graphs with all other possible attachment numbers. The case of attachment number 2 is dealt with in more detail. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 89–99, 2000     

A splitting theorem for connected moravaK-theories

LetX be a connected, locally finite spectrum and letk(n) (n>-1) denote the (−1)-connected cover of then-th MoravaK-Theory associated to the primep.k(n) is aBP-module spectrum with π_*(k(n)) ≅ ℤ _p [υ _n ] where |v _n | = 2(p ⁿ -1). We prove the following splitting theorem: Thek(n) ^*-torsion ofk(n) ^* (X) is already annihilated byv _n ^e (e≥1) if and only ifk(n)ΛX is homotopy equivalent to a wedge of spectrak(n) and ^r k(n) (0≤r≤e-1) where ^r k(n) denotes ther-th Postnikov factor ofk(n). Moreover we investigate splitting conditions for ^r k(n)ΛX.     

Coloring random graphs online without creating monochromatic subgraphs

Consider the following random process: The vertices of a binomial random graph G_n,p are revealed one by one, and at each step only the edges induced by the already revealed vertices are visible. Our goal is to assign to each vertex one from a fixed number r of available colors immediately and irrevocably without creating a monochromatic copy of some fixed graph F in the process. Our first main result is that for any F and r, the threshold function for this problem is given by p₀(F,r,n) = n^‐1/m*₁(F,r), where m*₁(F,r) denotes the so‐called online vertex‐Ramsey density of F and r. This parameter is defined via a purely deterministic two‐player game, in which the random process is replaced by an adversary that is subject to certain restrictions inherited from the random setting. Our second main result states that for any F and r, the online vertex‐Ramsey density m*₁(F,r) is a computable rational number. Our lower bound proof is algorithmic, i.e., we obtain polynomial‐time online algorithms that succeed in coloring G_n,p as desired with probability 1 ‐ o(1) for any p(n) = o(n^‐1/m*₁(F,r)). © 2012 Wiley Periodicals, Inc. Random Struct. Alg. 44, 419–464, 2014     

Non-commutative operator Bohr inequality

It is shown that if A, B, X are Hilbert space operators such that X?γI, for the positive real number γ, and p,q>1 with 1/p+1/q=1, then |A−B|²?p|A|²+q|B|² with equality if and only if (1−p)A=B and γ||||A−B|²|||?|||p|A|²X+qX|B|²||| for every unitarily invariant norm. Moreover, if in addition A, B are normal and X is any Hilbert-Schmidt operator, then ‖δ_A,B²(X)‖₂?‖p|A|²X+qX|B|²‖₂ with equality if and only if (1−p)AX=XB.     

ON ARC-TRANSITIVE CIRCULANT DIGRAPHS

Denote by c,(s)the circulant digraph with vertex set zn=[0,1,2……n-1]and symbol set s(≠-s)∈zn\[0].let x be the automorphism group of cn(S)and xo the stabilizer of o in x.then cn(S)is arctransitive if and only if xo acts transitively on s.in this paper,co(S)with xo is being the symmetric group is characterized by its symbot set .by the way all the arctransitive clcculant digraphs of degree 2are given.     

Hypergraph list coloring and Euclidean Ramsey theory

A hypergraph is simple if it has no two edges sharing more than a single vertex. It is s‐list colorable (or s‐choosable) if for any assignment of a list of s colors to each of its vertices, there is a vertex coloring assigning to each vertex a color from its list, so that no edge is monochromatic. We prove that for every positive integer r, there is a function d_r(s) such that no r‐uniform simple hypergraph with average degree at least d_r(s) is s‐list‐colorable. This extends a similar result for graphs, due to the first author, but does not give as good estimates of d_r(s) as are known for d₂(s), since our proof only shows that for each fixed r ≥ 2, d_r(s) ≤ 2 We use the result to prove that for any finite set of points X in the plane, and for any finite integer s, one can assign a list of s distinct colors to each point of the plane so that any coloring of the plane that colors each point by a color from its list contains a monochromatic isometric copy of X. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

A concentration result with application to subgraph count

Let H = (V,E) be a k ‐uniform hypergraph with a vertex set V and an edge set E. Let V _p be constructed by taking every vertex in V independently with probability p. Let X be the number of edges in E that are contained in V _p. We give a condition that guarantees the concentration of X within a small interval around its mean. The applicability of this result is demonstrated by deriving new sub‐Gaussian tail bounds for the number of copies of small complete and complete bipartite graphs in the binomial random graph. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

A New Regularity Criterion in Terms of the Direction of the Velocity for the MHD Equations

In this paper we obtain a new regularity criterion for weak solutions to the 3D MHD equations. It is proved that if div( \fracu|u|) \mathrm{div}( \frac{u}{|u|}) belongs to L^\frac21-r( 0,T;[(X)\dot]_r( \mathbbR³) ) L^{\frac{2}{1-r}}( 0,T;\dot{X}_{r}( \mathbb{R}^{3}) ) with 0≤r≤1, then the weak solution actually is regular and unique.     

Perfect fractional matchings in random hypergraphs

Given an r-uniform hypergraph H = (V, E) on |V| = n vertices, a real-valued function f:E→R⁺ is called a perfect fractional matching if Σ_vϵe f(e) ≤ 1 for all vϵV and Σ_eϵE f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n→ infinity, at the very moment t₀ when the last isolated vertex disappears, the hypergraph H_t0 has a perfect fractional matching. This result is clearly best possible. As a consequence, we derive that if p(n) = (ln n + w(n))/ , where w(n) is any function tending to infinity with n, then with probability tending to 1 a random r-uniform hypergraph on n vertices with edge probability p has a perfect fractional matching. Similar results hold also for random r-partite hypergraphs. © 1996 John Wiley & Sons, Inc.     

A Note on the Embedding of Subspaces of Lp into ℓNr, 0 < r < 1, r ≦ p < 2

In this paper we extend a result by Bourgain-Lindenstrauss-Milman (see [1]). We prove: Let 0 < ? < 1/2, 0< r < 1, r< p < 2. There exists a constant C = C(r,p,?) such that if X is any n-dimensional subspace of L_p(0, l), then there exists Y ? ?^N_r with d(X, Y) ≦ 1 + ?, whenever N > Cn. As an application, we obtain the following partial result: Let 0 < r < 1. There exist constants C = C(r) and C' = C' (r) such that if X is any n-dimensional subspace of L_r(0,1), then there exists Y ? ^N_r with d(X, Y) ≦ C (logn)^l/^r, whenever N ≧ C'n.