Erratum : Closures of faces of compact convex sets

A. K. Roy

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Erratum : Closures of faces of compact convex sets”

Erratum : On the Cech bicomplex associated with foliated structures

H. Kitahara, S. Yorozu (1978)

Annales de l'institut Fourier

Similarity:

Corrigendum to "A note on some properties of the functions φ(n), σ(n) and θ(n)'' by A. Schinzel and Y. Wang (these Annales 4 (1958))

A. Schinzel, Y. Wang (1967)

Annales Polonici Mathematici

Similarity:

Weak solutions to the complex Hessian equation

Zbigniew Blocki (2005)

Annales de l’institut Fourier

Similarity:

We investigate the class of functions associated with the complex Hessian equation ${(d d^{c} u)}^{m} \land ω^{n - m} = 0$ .

To the editor, Annales Universitatis Paedagogicae Cracoviensis

John T. Baldwin (2019)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

Letter to the editor

Letter to the Editor, Annales Universitatis Paedagogicae Cracoviensis

John T. Baldwin (2018)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

Letter to the Editor

Erratum : “Some classical function theory theorems and their modern versions”

J.L. Doob (1967)

Annales de l'institut Fourier

Similarity:

Finite expressions for the Bernoulli numbers obtained by the actual expansion of Trigonometric Functions by Maclaurins Theorem

I. J. Schwatt (1932)

Journal de Mathématiques Pures et Appliquées

Similarity:

Complexity and growth for polygonal billiards

J. Cassaigne, Pascal Hubert, Serge Troubetzkoy (2002)

Annales de l’institut Fourier

Similarity:

We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the complexity has cubic asymptotic growth.