Theorems of Large Deviations in the Approximation by the Compound Poisson Distribution

The paper is devoted to the research of large deviation probabilities in the approximation by compound Poisson law.     

New Interfaces for Coupling TLC with TOF SIMS

JPC – Journal of Planar Chromatography – Modern TLC - Two interfaces have been tested for coupling thin-layer chromatography (TLC) with time-of-flight secondary-ion mass spectrometry...     

Application of the Volterra filter in experimental diffraction data processing

The effective signal in x-ray diffraction analysis of material properties often contains high frequency (noise) and low frequency (trend) components as additive parts. It is necessary to extract the effective signal from the noise to ensure high quality of signal processing. Digital filters of Volterra type are proposed for filtering purposes and a comparison of Volterra filtration implemented on x-ray diffraction data versus results from a set of other digital filters is given.     

A remark on Lorentz algebras

We consider the class of Euclidean algebras associated to Minkowski light cones and called Lorentz algebras. We prove that in Lorentz algebras the estimate ∥P(a,b) ∥_∞≥(√2-1) ∥a∥_∞ ∥b∥_∞ is valid for the spectral norm and is therefore independent of the dimension of the Lorentz algebra.     

An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle

We prove lower bounds of the form exp(n^{ε d}), ε_d > 0, on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d, for any constant d. This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.     

Interpolation by a Game

We introduce a notion of a real game (a generalisation of the Karchmer-Wigderson game (cf. [3]) and of real communication complexity, and relate this complexity to the size of monotone real formulas and circuits. We give an exponential lower bound for tree-like monotone protocols (defined in [4, Definition 2.2]) of small real communication complexity solving the monotone communication complexity problem associated with the bipartite perfect matching problem. This work is motivated by a research in interpolation theorems for prepositional logic (by a problem posed in [5, Section 8], in particular). Our main objective is to extend the communication complexity approach of [4, 5] to a wider class of proof systems. In this direction we obtain an effective interpolation in a form of a protocol of small real communication complexity. Together with the above mentioned lower bound for tree-like protocols this yields as a corollary a lower bound on the number of steps for particular semantic derivations of Hall's theorem (these include tree-like cutting planes proofs for which an exponential lower bound was demonstrated in [2]).