Multi-criteria optimisation of the vibro-isolation properties

The paper deals with a methodology of shaping the vibro-isolation properties of suspensions applied in automotive systems. The developed optimisation procedure allows to find the Pareto-optimal system configuration for the conflicted vibro-isolating criteria. The correctness of proposed methodology is evaluated using the semi active and active systems with optimal controller settings. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The effect of points fattening on Hirzebruch surfaces

The purpose of this note is to study initial sequences of 0–dimensional subschemes of Hirzebruch surfaces and classify subschemes whose initial sequence has the minimal possible growth.     

Stabilité analytique et convergence locale de translatées en dynamique homogène S-arithmétique

We present the main result of Richard and Zamojski [14] concerning, in homogeneous dynamics, the general problem of the dynamics of sequences of translates of a certain measure in a space of S-arithmetic lattices.     

On the Asymptotic Behavior of Solutions of the Heat Equation with a Random,Long-Range Correlated Potential

In this note we investigate the asymptotic behavior of the solutions of the heat equation with random, fast oscillating potential

Comparisons and bounds for expected lifetimes of reliability systems

Sharp bounds on expectations of lifetimes of coherent and mixed systems composed of elements with independent and either identically or non-identically distributed lifetimes are expressed in terms of expected lifetimes of components. Similar evaluations are concluded for the respective mean residual lifetimes. In the IID case, improved inequalities dependent on a concentration parameter connected to the Gini dispersion index are obtained. The results can be used to compare systems with component lifetimes ordered in the convex ordering. In the INID case, some refined bounds are derived in terms of the expected lifetimes of series systems of smaller sizes, and the expected lifetime of single unit for the equivalent systems with IID components. The latter can be further simplified in the case of weak Schur-concavity and Schur-convexity of the system generalized domination polynomial.     

Calderón–Zygmund Operators in the Bessel Setting for All Possible Type Indices

We show that many harmonic analysis operators in the Bessel setting,including maximal operators,Littlewood–Paley–Stein type square functions,multipliers of Laplace or Laplace–Stieltjes transform type and Riesz transforms are,or can be viewed as,Calderón–Zygmund operators for all possible values of type parameter λ in this context.This extends results existing in the literature,but being justified only for a restricted range of λ.     

Embedding Banach spaces into the space of bounded functions with countable support

We prove that a WLD subspace of the space consisting of all bounded, countably supported functions on a set Γ embeds isomorphically into if and only if it does not contain isometric copies of . Moreover, a subspace of is constructed that has an unconditional basis, does not embed into , and whose every weakly compact subset is separable (in particular, it cannot contain any isomorphic copies of ).     

Asymmetry and structural information in preferential attachment graphs

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd?s‐Rényi graphs are typically asymmetric, real networks are highly symmetric. So a natural question is whether preferential attachment graphs, where in each step a new node with m edges is added, exhibit any symmetry. In recent work it was proved that preferential attachment graphs are symmetric for m = 1, and there is some nonnegligible probability of symmetry for m = 2. It was conjectured that these graphs are asymmetric when m ≥ 3. We settle this conjecture in the affirmative, then use it to estimate the structural entropy of the model. To do this, we also give bounds on the number of ways that the given graph structure could have arisen by preferential attachment. These results have further implications for information theoretic problems of interest on preferential attachment graphs.