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.     

Bending loss measurement using a fiber cavity ringdown scheme

A novel sensitive technique for the determination of losses in fiber cavities is presented. The method is based on the cavity ringdown scheme implemented in silica-based single-mode fibers. Bending losses of fiber cavities of different lengths have been measured showing all an oscillating behavior with respect to the curvature radius of the fiber as predicted by a theoretical model. The best minimum detectable absorbance per cavity pass achieved by this new method is 1.72×10⁻³ dB within a 10 m-long cavity. This limit suffices well for an accurate determination of optical bending losses even in bend-insensitive fibers. Furthermore, the comparison of the measured bending losses with a theoretical model allows the extraction of different fiber parameters. Good agreement has been found between the experimentally derived parameters and literature data.     

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.     

Optimization for pattern classification using biased random search techniques

We demonstrate how optimization problems arise in the field of pattern classification, in particular in using piecewise-linear classification and classification based on an optimal linear separator. We motivate the need in this area for a general purpose optimization approach. We discuss ALOPEX, a biased random search approach, from the point of view of this need. While ALOPEX itself failed to fulfil our need, a newly-introduced generalization of it (iterated ALOPEX) was found to be appropriate for the optimization problems of our particular concern. We conclude the paper with a brief critical evaluation of this approach as compared to our original aims.     

Model of free charge generation in polymers

A time solution of the excimer-ion pair system is presented here with a special attention to the time asymptote. Presented at the Czech-Israeli-German Symposium “Dynamical Processes in Condensed Molecular Systems”, Prague, Czech Republic, 26–30 May 1997. This work was supported by the grant No. C 1050601 of the Grant Agency of the Academy of Sciences of the Czech Republic.     

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]).     

Un théorème de type Beurling–Lax dans la boule unitéA Beurling–Lax type theorem in the unit ball

We prove a Beurling–Lax theorem for a family of reproducing kernel Hilbert spaces of functions analytic in an open subset of the unit ball containing the origin. The spaces under consideration are characterized by functions called Schur multipliers. Using the theory of linear relations in Pontryagin spaces we also give coisometric realizations of Schur multipliers. To cite this article: D. Alpay et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 349–354.     

On a certain two-sided symmetric condition in magnetic field analysis and computations

A special two-sided condition for the incremental magnetic reluctivity is introduced which guarantees the unique existence of both the weak and the approximate solutions of the nonlinear stationary magnetic field distributed on a region composed of different media, as well as a certain estimate of the error between the two solutions. The condition, being discussed from the physical as well as the mathematical point of view, can be easily verified and is fulfilled for various magnetic reluctivity models used in electrotechnical practice.     

Homomorphic images of finite subdirectly irreducible unary algebras

We prove that a finite unary algebra with at least two operation symbols is a homomorphic image of a (finite) subdirectly irreducible algebra if and only if the intersection of all its subalgebras which have at least two elements is nonempty. While working on this paper the first and the third authors were partially supported by the Grant Agency of the Czech Republic, grant #201/02/0594, and by the institutional grant MSM0021620839; the second author was supported by the Ministry of Science, Technologies and Development of Republic of Serbia, grant no. 1227.