T-theory
T-theory is a branch of discrete mathematics dealing with analysis of trees and discrete metric spaces. General history T-theory originated from a question raised by Manfred Eigen in the late 1970s. He was trying to fit twenty distinct t-RNA molecules of the ''Escherichia coli'' bacterium into a tree. An important concept of T-theory is the tight span of a metric space. If ''X'' is a metric space, the tight span ''T''(''X'') of ''X'' is, up to isomorphism, the unique minimal injective metric space that contains ''X''. John Isbell was the first to discover the tight span in 1964, which he called the injective envelope. Andreas Dress independently constructed the same construct, which he called the tight span. Application areas * Phylogenetic analysis, which is used to create phylogenetic trees. * Online algorithms - ''k''-server problem Recent developments * Bernd Sturmfels, Professor of Mathematics and Computer Science at Berkeley Berkeley most often refers to: *Berkeley, Cal ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Tight Span
In metric geometry, the metric envelope or tight span of a metric space ''M'' is an injective metric space into which ''M'' can be embedded. In some sense it consists of all points "between" the points of ''M'', analogous to the convex hull of a point set in a Euclidean space. The tight span is also sometimes known as the injective envelope or hyperconvex hull of ''M''. It has also been called the injective hull, but should not be confused with the injective hull of a module in algebra, a concept with a similar description relative to the category of ''R''-modules rather than metric spaces. The tight span was first described by , and it was studied and applied by Holsztyński in the 1960s. It was later independently rediscovered by and ; see for this history. The tight span is one of the central constructions of T-theory. Definition The tight span of a metric space can be defined as follows. Let (''X'',''d'') be a metric space, and let ''T''(''X'') be the set of extremal functio ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Andreas Dress
Andreas Dress (born 26 August 1938) is a German mathematician specializing in geometry, combinatorics and mathematical biology. Dress earned his PhD from the University of Kiel in 1962, under the supervision of Friedrich Bachmann and Karl-Heinrich Weise. His thesis is entitled ''Konstruktion metrischer Ebenen''. He has been a professor of mathematics at the University of Bielefeld since 1969. In 1998 he was an Invited Speaker of the International Congress of Mathematicians in Berlin. See also *Split networks *SplitsTree *T-theory *Tight span In metric geometry, the metric envelope or tight span of a metric space ''M'' is an injective metric space into which ''M'' can be embedded. In some sense it consists of all points "between" the points of ''M'', analogous to the convex hull of a po ... References Living people 1938 births 20th-century German mathematicians University of Kiel alumni Academic staff of Bielefeld University {{Germany-mathematician-stub ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Phylogenetic Tree
A phylogenetic tree (also phylogeny or evolutionary tree Felsenstein J. (2004). ''Inferring Phylogenies'' Sinauer Associates: Sunderland, MA.) is a branching diagram or a tree showing the evolutionary relationships among various biological species or other entities based upon similarities and differences in their physical or genetic characteristics. All life on Earth is part of a single phylogenetic tree, indicating common ancestry. In a ''rooted'' phylogenetic tree, each node with descendants represents the inferred most recent common ancestor of those descendants, and the edge lengths in some trees may be interpreted as time estimates. Each node is called a taxonomic unit. Internal nodes are generally called hypothetical taxonomic units, as they cannot be directly observed. Trees are useful in fields of biology such as bioinformatics, systematics, and phylogenetics. ''Unrooted'' trees illustrate only the relatedness of the leaf nodes and do not require the ancestral root to b ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite se ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Commentarii Mathematici Helvetici
The ''Commentarii Mathematici Helvetici'' is a quarterly peer-reviewed scientific journal in mathematics. The Swiss Mathematical Society started the journal in 1929 after a meeting in May of the previous year. The Swiss Mathematical Society still owns and operates the journal; the publishing is currently handled on its behalf by the European Mathematical Society. The scope of the journal includes research articles in all aspects in mathematics. The editors-in-chief have been Rudolf Fueter (1929–1949), J.J. Burckhardt (1950–1981), P. Gabriel (1982–1989), H. Kraft (1990–2005), and Eva Bayer-Fluckiger (2006–present). Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the journal has a 2019 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a scientometric index calculated by Clarivate that reflects the yearly mean number of citations of articles published ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
European Journal Of Combinatorics
European, or Europeans, or Europeneans, may refer to: In general * ''European'', an adjective referring to something of, from, or related to Europe ** Ethnic groups in Europe ** Demographics of Europe ** European cuisine, the cuisines of Europe and other Western countries * ''European'', an adjective referring to something of, from, or related to the European Union ** Citizenship of the European Union ** Demographics of the European Union In publishing * ''The European'' (1953 magazine), a far-right cultural and political magazine published 1953–1959 * ''The European'' (newspaper), a British weekly newspaper published 1990–1998 * ''The European'' (2009 magazine), a German magazine first published in September 2009 *''The European Magazine'', a magazine published in London 1782–1826 *''The New European'', a British weekly pop-up newspaper first published in July 2016 Other uses * * Europeans (band), a British post-punk group, from Bristol See also * * * Europe (disam ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Advances In Mathematics
''Advances in Mathematics'' is a peer-reviewed scientific journal covering research on pure mathematics. It was established in 1961 by Gian-Carlo Rota. The journal publishes 18 issues each year, in three volumes. At the origin, the journal aimed at publishing articles addressed to a broader "mathematical community", and not only to mathematicians in the author's field. Herbert Busemann writes, in the preface of the first issue, "The need for expository articles addressing either all mathematicians or only those in somewhat related fields has long been felt, but little has been done outside of the USSR. The serial publication ''Advances in Mathematics'' was created in response to this demand." Abstracting and indexing The journal is abstracted and indexed in: * [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
University Of California, Berkeley
The University of California, Berkeley (UC Berkeley, Berkeley, Cal, or California) is a public land-grant research university in Berkeley, California. Established in 1868 as the University of California, it is the state's first land-grant university and the founding campus of the University of California system. Its fourteen colleges and schools offer over 350 degree programs and enroll some 31,800 undergraduate and 13,200 graduate students. Berkeley ranks among the world's top universities. A founding member of the Association of American Universities, Berkeley hosts many leading research institutes dedicated to science, engineering, and mathematics. The university founded and maintains close relationships with three national laboratories at Berkeley, Livermore and Los Alamos, and has played a prominent role in many scientific advances, from the Manhattan Project and the discovery of 16 chemical elements to breakthroughs in computer science and genomics. Berkeley is ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Bernd Sturmfels
Bernd Sturmfels (born March 28, 1962 in Kassel, West Germany) is a Professor of Mathematics and Computer Science at the University of California, Berkeley and is a director of the Max Planck Institute for Mathematics in the Sciences in Leipzig since 2017. Education and career He received his PhD in 1987 from the University of Washington and the Technische Universität Darmstadt. After two postdoctoral years at the Institute for Mathematics and its Applications in Minneapolis, Minnesota, and the Research Institute for Symbolic Computation in Linz, Austria, he taught at Cornell University, before joining University of California, Berkeley in 1995. His Ph.D. students include Melody Chan, Jesús A. De Loera, Mike Develin, Diane Maclagan, Rekha R. Thomas, Caroline Uhler, and Cynthia Vinzant. Contributions Bernd Sturmfels has made contributions to a variety of areas of mathematics, including algebraic geometry, commutative algebra, discrete geometry, Gröbner bases, toric varietie ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
K-server Problem
The -server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are central to the theory of competitive analysis (the other being metrical task systems). In this problem, an online algorithm must control the movement of a set of ''k'' ''servers'', represented as points in a metric space, and handle ''requests'' that are also in the form of points in the space. As each request arrives, the algorithm must determine which server to move to the requested point. The goal of the algorithm is to keep the total distance all servers move small, relative to the total distance the servers could have moved by an optimal adversary who knows in advance the entire sequence of requests. The problem was first posed by Mark Manasse, Lyle A. McGeoch and Daniel Sleator (1988). The most prominent open question concerning the ''k''-server problem is the so-called ''k''-server conjecture, also posed by Manasse e ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Online Algorithm
In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed to the algorithm, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand. In operations research, the area in which online algorithms are developed is called online optimization. As an example, consider the sorting algorithms selection sort and insertion sort: selection sort repeatedly selects the minimum element from the unsorted remainder and places it at the front, which requires access to the entire input; it is thus an offline algorithm. On the other hand, insertion sort considers one input element per iteration and produces a partial solution without considering future elements. Thus insertion sort is an online algorithm. Note that the final result of an insertion sort ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
John Isbell
John Rolfe Isbell (October 27, 1930 – August 6, 2005) was an American mathematician, for many years a professor of mathematics at the University at Buffalo (SUNY). Biography Isbell was born in Portland, Oregon, the son of an army officer from Isbell, a town in Franklin County, Alabama... He attended several undergraduate institutions, including the University of Chicago, where professor Saunders Mac Lane was a source of inspiration. He began his graduate studies in mathematics at Chicago, briefly studied at Oklahoma A&M University and the University of Kansas, and eventually completed a Ph.D. in game theory at Princeton University in 1954 under the supervision of Albert W. Tucker. After graduation, Isbell was drafted into the U.S. Army, and stationed at the Aberdeen Proving Ground. In the late 1950s he worked at the Institute for Advanced Study in Princeton, New Jersey, from which he then moved to the University of Washington and Case Western Reserve University. He joined the Un ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |