1-Meixner Random Vectors

Journal of Theoretical Probability - A definition of d-dimensional n-Meixner random vectors is given first. This definition involves the commutators of their semi-quantum operators. After that we...     

Tracing Possible Structural Asymmetry of Silica Gel Used for Precoating Thin-Layer Chromatography Plates

JPC – Journal of Planar Chromatography – Modern TLC - We have previously described unexpected two-dimensionality in the thin-layer chromatographic separation of pairs of enantiomers of...     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

A Galois Connection

The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other. Mathematics Subject Classification (2000): Primary 06A15, Secondary 28E10 03B22     

Existence for a degenerate diffusion problem with a nonlinear operator

We study a degenerate nonlinear variational inequality which can be reduced to a multivalued inclusion by an appropriate change of the unknown function. We establish existence, uniqueness and regularity results. An application arising in the theory of water diffusion in porous media is discussed as an example.      

Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks.     

Thermal behaviour of polyacrylamidoxime-copper chelates

The purpose of this work was to investigate the effect of several factors (anion type in the copper salt, pH and concentration of the salt solution) on the structure and thermo-oxidative degradation of the polyacrylamidoxime-copper chelates, by using elemental analysis, IR spectroscopy and dynamic thermogravimetry. The chelates containing copper ions as sulphate exhibit a better initial thermal stability than the polyacrylamidoxime fibre presumably due to the crosslinking generated by the intermolecular complexation of the ions; the removal of the sulphate anions takes place concomitantly with the second step of polymeric chain decomposition. The initial thermal decomposition of the chelates formed by copper ions as nitrate begins at lower temperatures as compared to the polyacrylamidoxime fibre, probably by the nitrate anion release, which partly overlaps the initial decomposition of the copper ion-crosslinked polymeric chains. Copper ions as either sulphate or nitrate catalyse the reactions involved in the main step of polyacrylamidoxime fibre decomposition; the higher the copper amount, the stronger the catalytic effect.