Tibor Šalát | |
---|---|
Born | |
Died | May 14, 2005 79) | (aged
Nationality | Slovakian |
Alma mater | Charles University in Prague |
Known for | Number theory Real analysis |
Scientific career | |
Fields | Mathematician |
Institutions | Comenius University in Bratislava |
Tibor Šalát (May 13, 1926 – May 14, 2005) was a Slovak mathematician, professor of mathematics, and Doctor of Mathematics who specialized in number theory and real analysis. He was the author and co-author of undergraduate and graduate textbooks in mathematics, mostly in Slovak. And most of his scholarly papers have been published in various scientific journals.
Originally from Žitava by the southern region of Slovakia, he studied at the Faculty of Natural Sciences of Charles University in Prague, where in 1952 he defended a dissertation entitled Príspevok k teorii súčtov a nekonečných radov s reálnými členami and supervised by Miloš Kössler and Vojtěch Jarník. [1] In 1952 he went to work at the Faculty of Natural Sciences of Comenius University in Bratislava, where he became an assistant professor in 1962. He was appointed to a full professorship position in 1972. And in 1974, he earned a Ph.D. in Mathematics from the same institution. [2]
He specialized in Cantor's expansions, uniform distribution, statistical convergence, summation methods and theory of numbers. [2]
He wrote several undergraduate and graduate textbooks.
In mathematics, a cyclic order is a way to arrange a set of objects in a circle. Unlike most structures in order theory, a cyclic order is not modeled as a binary relation, such as "a < b". One does not say that east is "more clockwise" than west. Instead, a cyclic order is defined as a ternary relation [a, b, c], meaning "after a, one reaches b before c". For example, [June, October, February], but not [June, February, October], cf. picture. A ternary relation is called a cyclic order if it is cyclic, asymmetric, transitive, and connected. Dropping the "connected" requirement results in a partial cyclic order.
In mathematics, the Weierstrass function is an example of a real-valued function that is continuous everywhere but differentiable nowhere. It is an example of a fractal curve. It is named after its discoverer Karl Weierstrass.
Jaroslav Kurzweil was a Czech mathematician.
Vojtěch Jarník was a Czech mathematician. He worked for many years as a professor and administrator at Charles University, and helped found the Czechoslovak Academy of Sciences. He is the namesake of Jarník's algorithm for minimum spanning trees.
In mathematics, a ternary relation or triadic relation is a finitary relation in which the number of places in the relation is three. Ternary relations may also be referred to as 3-adic, 3-ary, 3-dimensional, or 3-place.
A non-integer representation uses non-integer numbers as the radix, or base, of a positional numeral system. For a non-integer radix β > 1, the value of
Robert Gardner Bartle was an American mathematician specializing in real analysis. He is known for writing the popular textbooks The Elements of Real Analysis (1964), The Elements of Integration (1966), and Introduction to Real Analysis (2011) with Donald R. Sherbert, published by John Wiley & Sons.
In mathematical analysis, Mosco convergence is a notion of convergence for functionals that is used in nonlinear analysis and set-valued analysis. It is a particular case of Γ-convergence. Mosco convergence is sometimes phrased as “weak Γ-liminf and strong Γ-limsup” convergence since it uses both the weak and strong topologies on a topological vector space X. In finite dimensional spaces, Mosco convergence coincides with epi-convergence, while in infinite-dimensional ones, Mosco convergence is strictly stronger property.
Ivo M. Babuška was a Czech-American mathematician, noted for his studies of the finite element method and the proof of the Babuška–Lax–Milgram theorem in partial differential equations. One of the celebrated result in the finite elements is the so-called Ladyzenskaja–Babuška–Brezzi (LBB) condition, which provides sufficient conditions for a stable mixed formulation. The LBB condition has guided mathematicians and engineers to develop state-of-the-art formulations for many technologically important problems like Darcy flow, Stokes flow, incompressible Navier–Stokes, nearly incompressible elasticity.
Ulrike Luise Tillmann FRS is a mathematician specializing in algebraic topology, who has made important contributions to the study of the moduli space of algebraic curves. She is the president of the London Mathematical Society in the period 2021–2022.
David Preiss FRS is a Czech and British mathematician, specializing in mathematical analysis. He is a professor of mathematics at the University of Warwick
In mathematics — specifically, in functional analysis — an Asplund space or strong differentiability space is a type of well-behaved Banach space. Asplund spaces were introduced in 1968 by the mathematician Edgar Asplund, who was interested in the Fréchet differentiability properties of Lipschitz functions on Banach spaces.
In mathematics, Nambooripad order is a certain natural partial order on a regular semigroup discovered by K S S Nambooripad in late seventies. Since the same partial order was also independently discovered by Robert E Hartwig, some authors refer to it as Hartwig–Nambooripad order. "Natural" here means that the order is defined in terms of the operation on the semigroup.
Ladislav Svante Rieger (1916–1963) was a Czechoslovak mathematician who worked in the areas of algebra, mathematical logic, and axiomatic set theory. He is considered to be the founder of mathematical logic in Czechoslovakia, having begun his work around 1957.
In mathematics, a cyclically ordered group is a set with both a group structure and a cyclic order, such that left and right multiplication both preserve the cyclic order.
In mathematics, a partial cyclic order is a ternary relation that generalizes a cyclic order in the same way that a partial order generalizes a linear order.
Zbyněk Šidák was a Czech mathematician. He is known for developing the Šidák correction.
In graph theory, an induced matching or strong matching is a subset of the edges of an undirected graph that do not share any vertices and includes every edge connecting any two vertices in the subset.
Věra Šedivá-Trnková was a Czech mathematician known for her work in topology and in category theory.
In graph theory and polyhedral combinatorics, areas of mathematics, Kotzig's theorem is the statement that every polyhedral graph has an edge whose two endpoints have total degree at most 13. An extreme case is the triakis icosahedron, where no edge has smaller total degree. The result is named after Anton Kotzig, who published it in 1955 in the dual form that every convex polyhedron has two adjacent faces with a total of at most 13 sides. It was named and popularized in the west in the 1970s by Branko Grünbaum.