Linking (n − 2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-frames

A (k – 1,k)-graph is a multi-graph satisfyinge (k – 1)v – k for every non-empty subset ofe edges onv vertices, with equality whene = |E(G)|. A (k – 1,k)-frame is a structure generalizing an (n – 2, 2)-framework inn-space, a structure consisting of a set of (n – 2)-dimensional bodies inn-space and a set of rigid bars each joining a pair of bodies using ball joints. We prove that a graph is the graph of a minimally rigid (with respect to edges) (k – 1,k)-frame if and only if it is a (k – 1,k)-graph. Rigidity here means infinitesimal rigidity or equivalently statical rigidity.     

Gibbs–Markov–Young structures with (stretched) exponential tail for partially hyperbolic attractors

In this work we extend the results obtained by Gouëzel in [12] to partially hyperbolic attractors. We study a forward invariant set K on a Riemannian manifold M   whose tangent space splits as dominated decomposition _TKM=E^cu⊕E^s$T_{K}M=E^{cu}\oplus E^s$, for which the center-unstable direction E^cu$E^{cu}$ is non-uniformly expanding on some local unstable disk. We prove that the (stretched) exponential decay of recurrence times for an induced scheme can be deduced under the assumption of (stretched) exponential decay of the time that typical points need to achieve some uniform expanding in the center-unstable direction. As an application of our results we obtain exponential decay of correlations and exponential large deviations for a class of partially hyperbolic diffeomorphisms considered in [1].     

Propertyf −1(S) =g −1(S) for entire and meromorphicP-adic functions

LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS _n(b) of zeros of the polynomialx ⁿ−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), thenf ⁿ=g ⁿ. For everyn≥14, we show thatS _n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), then eitherf ⁿ=g ⁿ, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively. For everyn≥9, we show that the setY _n(c) of zeros of the polynomial , (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY _n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders.     

A tactical model for planning the production and distribution of fresh produce

We present an integrated tactical planning model for the production and distribution of fresh produce. The main objective of the model is to maximize the revenues of a producer that has some control over the logistics decisions associated with the distribution of the crop. The model is used for making planning decisions for a large fresh produce grower in Northwestern Mexico. The decisions obtained are based on traditional factors such as price estimation and resource availability, but also on factors that are usually neglected in traditional planning models such as price dynamics, product decay, transportation and inventory costs. The model considers the perishability of the crops in two different ways, as a loss function in its objective function, and as a constraint for the storage of products. The paper presents a mixed integer programming model used to implement the problem as wells as the computational results obtained from it.     

Minimal coverings and maximal packings of (k−1)-subsets by k-subsets

This paper studies the asymptotic behavior of functions M(n, k, k–1, ) and m(n, k, k–1, ), equal to the respective cardinalities of the minimal -covering and maximal -packing of all (k–1)-subsets of the n-element set of its k-subsets. It is shown that, if sequence k=k(n) is such that k(n)/n 0 as then m(n, k, k–1, ).( _k–1 ⁿ ).k¹, and if as n , thenM(n,k,k–1,).( _k–1 ⁿ ).k^–1. A consequence of these results is the validity of the Erdös-Hanani conjecture concerning the asymptotic behavior of functions M(n, k, k–1, 1) and m(n, k, k–1, 1).Translated from Matematicheskie Zametki, Vol. 21, No. 4, pp. 565–571, April, 1977.In conclusion, the author wishes to thank A. A. Sapozhenko under whose direction the present work was achieved.     

Darboux Transformation and Exact Solutions for Two Dimensional A 2n−1 (2) Toda Equations

The Darboux transformation for the two dimensional A⁽²⁾_2n-1 Toda equations is constructed so that it preserves all the symmetries of the corresponding Lax pair. The expression of exact solutions of the equation is obtained by using Darboux transformation.     

A general sufficient condition for a graph G with λ_m(G)≤ξ_m(G)

It has been shown that a λ m-connected graph G has the property λ m (G)≤ξ m (G) for m≤3.But for m≥4,Bonsma et al.pointed out that in general the inequality λ m (G)≤ξ m (G) is no longer true.Recently Ou showed that any λ 4-connected graph G with order at least 11 has the property λ 4 (G)≤ξ 4 (G).In this paper,by investigating some structure properties of a λ m-connected graph G with λ m (G) ξ m (G),we obtain easily the above result.Furthermore,we show that every λ m-connected graph G with order greater than m(m-1) satisfies the inequality λ m (G)≤ξm (G) for m≥5.And by constructing some examples,we illustrate that our conditions are the best possible.     

Spectral methods for bivariate Markov processes with diffusion and discrete components and a variant of the Wright–Fisher model

The aim of this paper is to study differential and spectral properties of the infinitesimal operator of two dimensional Markov processes with diffusion and discrete components. The infinitesimal operator is now a second-order differential operator with matrix-valued coefficients, from which we can derive backward and forward equations, a spectral representation of the probability density, study recurrence of the process and the corresponding invariant distribution. All these results are applied to an example coming from group representation theory which can be viewed as a variant of the Wright–Fisher model involving only mutation effects.     

A characterization of a class of hyperplanes of DW(2n−1,F)

A hyperplane of the symplectic dual polar space $DW(2n?1,\mathbb{F})$, $n\ge 2$, is said to be of subspace-type if it consists of all maximal singular subspaces of $W(2n?1,\mathbb{F})$ meeting a given $(n?1)$-dimensional subspace of $\text{PG}(2n?1,\mathbb{F})$. We show that a hyperplane of $DW(2n?1,\mathbb{F})$ is of subspace-type if and only if every hex $F$ of $DW(2n?1,\mathbb{F})$ intersects it in either $F$, a singular hyperplane of $F$ or the extension of a full subgrid of a quad. In the case $\mathbb{F}$ is a perfect field of characteristic 2, a stronger result can be proved, namely a hyperplane $H$ of $DW(2n?1,\mathbb{F})$ is of subspace-type or arises from the spin-embedding of $DW(2n?1,\mathbb{F})?DQ(2n,\mathbb{F})$ if and only if every hex $F$ intersects it in either $F$, a singular hyperplane of $F$, a hexagonal hyperplane of $F$ or the extension of a full subgrid of a quad.     

A new asymptotic bound of the minimum possible odd cardinality of spherical (2k−1)-designs

We apply polynomial techniques to investigate the structure of spherical designs in an asymptotic process with fixed odd strength while the dimension and odd cardinality tend to infinity in a certain relation. Our bounds for the extreme inner products of special points in such designs allow new lower bounds on the minimum possible odd cardinality.