Conservation of the integrality of certain quotients by iterated substitutions of Lucas numbers.
Picon, Pierre-André (1993)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “Convergence of lattice trees to super-Brownian motion above the critical dimension.”
Conservation of the integrality of certain quotients by iterated substitutions of Lucas numbers.
Lifting of the binomial coefficients in Witt vectors. (Relèvement des coefficients binômiaux dans les vecteurs de Witt.)
Gaudier, Henri (1987)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Shaking compact sets.
Campi, Stefano, Colesanti, Andrea, Gronchi, Paolo (2001)
Beiträge zur Algebra und Geometrie
Similarity:
The triple, quintuple and setuple product identities revisited.
Foata, Dominique, Han, Guo-Niu (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Deviation measures and normals of convex bodies.
Groemer, H. (2004)
Beiträge zur Algebra und Geometrie
Similarity:
- and -theory of the semi-direct product of the discrete 3-dimensional Heisenberg group by .
Lück, Wolfgang (2005)
Geometry & Topology
Similarity:
-matroids and Pfaffian forms.
Wenzel, Walter (1991)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On the dimension of finite permutation group actions.
Smith, Jonathan D.H. (2003)
Beiträge zur Algebra und Geometrie
Similarity:
On multiplicities of points on Schubert varieties in Grassmannians.
Krattenthaler, C. (2000)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
An improved estimate concerning 3n+1 predecessor sets
Günther Wirsching (1993)
Acta Arithmetica
Similarity:
Chance constrained problems: penalty reformulation and performance of sample approximation technique
Martin Branda (2012)
Kybernetika
Similarity:
We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving...