HOME
*





Manuel Kauers
Manuel Kauers (born 20 February 1979 in Lahnstein, West Germany) is a German mathematician and computer scientist. He is working on computer algebra and its applications to discrete mathematics. He is currently professor for algebra at Johannes Kepler University (JKU) in Linz, Austria, and leader of the Institute for Algebra at JKU. Before that, he was affiliated with that university's Research Institute for Symbolic Computation (RISC). Kauers studied computer science at the University of Karlsruhe in Germany from 1998 to 2002 and then moved to RISC, where he completed his PhD in symbolic computation in 2005 under the supervision of Peter Paule. He earned his habilitation in mathematics from JKU in 2008. Together with Doron Zeilberger and Christoph Koutschan, Kauers proved two famous open conjectures in combinatorics using large scale computer algebra calculations. Both proofs appeared in the Proceedings of the National Academy of Sciences. The first concerned a conject ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Lahnstein
Lahnstein () is a ''verband''-free town of Rhein-Lahn-Kreis in Rhineland-Palatinate, Germany. It is situated at the confluence of the Lahn with the Rhine, approximately south of Koblenz. Lahnstein was created in 1969 by the merger of the previously independent towns of Oberlahnstein (or Upper Lahnstein) on the south side of the Lahn (above the river mouth) and Niederlahnstein on the north side (below the river mouth). In 2020, it had a population of 18,030. Situated on the heights of the foothills of the Westerwald and the Taunus, Lahnstein is considered a fresh-air spa city with spa facilities and thermal baths. It is also the seat of a district court. In religious affairs, it is assigned to the Roman Catholic Diocese of Limburg and to the Evangelical Church in Hesse and Nassau. Because of its strategic importance on the Rhine, Lahnstein was heavily fortified. Many old gates and towers still demonstrate its importance in the Middle Ages. Lahneck Castle, situated high above Ober ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Symbolic Computation
In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. Although computer algebra could be considered a subfield of scientific computing, they are generally considered as distinct fields because scientific computing is usually based on numerical computation with approximate floating point numbers, while symbolic computation emphasizes ''exact'' computation with expressions containing variables that have no given value and are manipulated as symbols. Software applications that perform symbolic calculations are called ''computer algebra systems'', with the term ''system'' alluding to the complexity of the main applications that include, at least, a method to represent mathematical data in a computer, a user programming language (usually different from the languag ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

1979 Births
Events January * January 1 ** United Nations Secretary-General Kurt Waldheim heralds the start of the ''International Year of the Child''. Many musicians donate to the ''Music for UNICEF Concert'' fund, among them ABBA, who write the song ''Chiquitita'' to commemorate the event. ** The United States and the People's Republic of China establish full Sino-American relations, diplomatic relations. ** Following a deal agreed during 1978, France, French carmaker Peugeot completes a takeover of American manufacturer Chrysler's Chrysler Europe, European operations, which are based in United Kingdom, Britain's former Rootes Group factories, as well as the former Simca factories in France. * January 7 – Cambodian–Vietnamese War: The People's Army of Vietnam and Vietnamese-backed Kampuchean United Front for National Salvation, Cambodian insurgents announce the fall of Phnom Penh, Cambodia, and the collapse of the Pol Pot regime. Pol Pot and the Khmer Rouge retreat west to an area ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


George Andrews (mathematician)
George Eyre Andrews (born December 4, 1938) is an American mathematician working in special functions, number theory, mathematical analysis, analysis and combinatorics. Education and career He is currently an Evan Pugh Professor of Mathematics at Pennsylvania State University. He did his undergraduate studies at Oregon State University and received his PhD in 1964 at the University of Pennsylvania where his advisor was Hans Rademacher. During 2008–2009 he was president of the American Mathematical Society. Contributions Andrews's contributions include several monographs and over 250 research and popular articles on q-series, special functions, combinatorics and applications. He is considered to be the world's leading expert in the theory of integer partitions. In 1976 he discovered Ramanujan's Ramanujan's lost notebook, Lost Notebook. He is highly interested in mathematical pedagogy. His book ''The Theory of Partitions'' is the standard reference on the subject of integer par ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Plane Partition
In mathematics and especially in combinatorics, a plane partition is a two-dimensional array of nonnegative integers \pi_ (with positive number, positive integer indices ''i'' and ''j'') that is nonincreasing in both indices. This means that : \pi_ \ge \pi_ and \pi_ \ge \pi_ for all ''i'' and ''j''. Moreover, only finitely many of the \pi_ may be nonzero. Plane partitions are a generalization of Partition (number theory), partitions of an integer. A plane partition may be represented visually by the placement of a stack of \pi_ unit cubes above the point (''i'', ''j'') in the plane, giving a three-dimensional solid as shown in the picture. The image has matrix form : \begin 4 & 4 & 3 & 2 & 1\\ 4 & 3 & 1 & 1\\ 3 & 2 & 1\\ 1 \end Plane partitions are also often described by the positions of the unit cubes. From this point of view, a plane partition can be defined as a finite subset \mathcal of positive integer lattice points (''i'', ''j'', ''k'') in \mathbb^3, such that if (''r'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Generating Function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers () by treating them as the coefficients of a formal power series. This series is called the generating function of the sequence. Unlike an ordinary series, the ''formal'' power series is not required to converge: in fact, the generating function is not actually regarded as a function, and the "variable" remains an indeterminate. Generating functions were first introduced by Abraham de Moivre in 1730, in order to solve the general linear recurrence problem. One can generalize to formal power series in more than one indeterminate, to encode information about infinite multi-dimensional arrays of numbers. There are various types of generating functions, including ordinary generating functions, exponential generating functions, Lambert series, Bell series, and Dirichlet series; definitions and examples are given below. Every sequence in principle has a generating function of each type (except ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Alin Bostan
Alin may refer to: * Alin, Iran, a village * Arid Lands Information Network, a Kenyan NGO * Alin, a magical civilization in the video game '' Rise of Nations: Rise of Legends'' * ''Alianza de Izquierda Nacional'' (Alliance of the National Left), a left-wing political party in Bolivia * Oscar Alin (1846–1900), Swedish historian and politician * Alin Goyan Alin Goyan ( hy, Ալին Գոյան) is an Armenian music singer from Yerevan, Armenia. Her repertoire includes traditional music from Komitas as well as pop songs. She started to attend vocal music school of voice conservation when she was six, ... (born 1983), Armenian singer * A-Lin (born 1983), aboriginal Taiwanese pop singer See also

* {{disambiguation, given name, surname ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ira Gessel
Ira Martin Gessel (born 9 April 1951 in Philadelphia, Pennsylvania) is an American mathematician, known for his work in combinatorics. He is a long-time faculty member at Brandeis University and resides in Arlington, Massachusetts. Education and career Gessel studied at Harvard University graduating ''magna cum laude'' in 1973. There, he became a Putnam Fellow in 1972, alongside Arthur Rubin and David Vogan. He received his Ph.D. at MIT and was the first student of Richard P. Stanley. He was then a postdoctoral fellow at the Thomas J. Watson Research Center, IBM Watson Research Center and MIT. He then joined Brandeis University faculty in 1984. He was promoted to Professor of Mathematics and Computer Science in 1990, became a chair in 1996–98, and Professor Emeritus in 2015. Gessel is a prolific contributor to enumerative combinatorics, enumerative and algebraic combinatorics. He is credited with the invention of quasisymmetric functions in 1984 and foundational work on th ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Proceedings Of The National Academy Of Sciences
''Proceedings of the National Academy of Sciences of the United States of America'' (often abbreviated ''PNAS'' or ''PNAS USA'') is a peer-reviewed multidisciplinary scientific journal. It is the official journal of the National Academy of Sciences, published since 1915, and publishes original research, scientific reviews, commentaries, and letters. According to ''Journal Citation Reports'', the journal has a 2021 impact factor of 12.779. ''PNAS'' is the second most cited scientific journal, with more than 1.9 million cumulative citations from 2008 to 2018. In the mass media, ''PNAS'' has been described variously as "prestigious", "sedate", "renowned" and "high impact". ''PNAS'' is a delayed open access journal, with an embargo period of six months that can be bypassed for an author fee ( hybrid open access). Since September 2017, open access articles are published under a Creative Commons license. Since January 2019, ''PNAS'' has been online-only, although print issues are a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]