「combinatorics」の共起表現(1語右で並び替え)

「combinatorics」の共起表現一覧(1語右で並び替え)

combinatorics

1語右で並び替え

該当件数:70件

In polyhedral combinatorics, a branch of mathematics, Steinitz's theor
They play an important role in polyhedral combinatorics: according to the Upper Bound Conjecture,
Census of Colorings, Journal of Algebraic Combinatorics: An International Journal, Volume 1, Issue
In geometry and combinatorics, an arrangement of hyperplanes is a finite
In 2004, the Institute of Combinatorics and its Applications named Colbourn as tha
ublished several important results in both combinatorics and number theory.
ouble description" algorithm of polyhedral combinatorics and computational geometry.
heorem: Lectures on Topological Methods in Combinatorics and Geometry.
Faudree specializes in combinatorics, and specifically in graph theory and Rams
Graph Theory and the Electronic Journal of Combinatorics, and editor of Combinatorica, the Journal
ian-Canadian mathematician specializing in combinatorics and graph theory.
utstanding problems, using techniques from combinatorics and probability theory (especially stoppin
r articles on q-series, special functions, combinatorics and applications.
adian mathematician, expert in statistics, combinatorics and graph theory.
k is mostly in the areas of number theory, combinatorics and discrete geometry, including graph the
including foundation work in the fields of combinatorics and graph theory.
e was elected a Fellow of the Institute of Combinatorics and its Applications (1995) and a Fellow o
Sanders received his Ph.D. in algorithms, combinatorics, and optimization from Georgia Tech in 199
ecognized as one of the modern founders of combinatorics and graph theory.
and a Founding Fellow of the Institute of Combinatorics and its Applications.
), and the Euler Medal of the Institute of Combinatorics and its Applications (1999).
ebra of two dimensions with matrices, some combinatorics, and a little statistics.
Godsil is a professor at the Department of Combinatorics and Optimization in the faculty of mathema
in the areas of modular forms, partitions, combinatorics and number theory.
e renown of the University's Department of Combinatorics and Optimization.
ce, the Journal of Automata, Languages and Combinatorics, and of Theoretical Computer Science.
An incidence matrix in combinatorics and finite geometry has ones to indicate i
t of 32 listed in discrete mathematics and combinatorics, and is in the second of four tiers out of
, is a founding fellow of the Institute of Combinatorics and its Applications, and has an Erdos num
In combinatorics and order-theoretic mathematics, a multitr
Shrikhande's specialty was combinatorics, and statistical designs.
He started the Journal of Algebraic Combinatorics, and was the Editor-in-Chief of the Electr
Issue: Journal of Automata, Languages and Combinatorics, announced (as of January 2009)
His research interest is combinatorics, as well as the related areas of algebra,
rofessor of Pure Mathematics, specifically combinatorics, at the University of Cambridge.
In graph theory and combinatorics, both fields within mathematics, a matchin
A similar problem also appears in combinatorics, complexity theory, cryptography and appli
mp, students are taught in the branches of combinatorics, computer game theory, advanced algorithms
of mathematics, including automata theory, combinatorics, discrete geometry, dynamical systems, gro
harmonic analysis, analytic number theory, combinatorics, ergodic theory, partial differential equa
In additive combinatorics, Folkman's theorem states that for each as
decompositions of complete graphs and also combinatorics games.
esearch ranges across the subject areas of combinatorics, graph theory, discrete geometry, and numb
Combinatorics, Graph Theory, and Computing.
He specialises in algebra and combinatorics; he has written books about combinatorics,
In mathematical programming and polyhedral combinatorics, Hirsch's conjecture states that the edge-
Pierre Cartier and Dominique Foata for its combinatorics in the 1960s, trace theory was first formu
re heavily involved in the applications of combinatorics in statistical design, communications theo
His work in combinatorics includes an important paper of 1943 on pro
s of mathematics within the broad field of combinatorics, including random graphs, percolation, ext
- Number theory, ChT - Chaos theory, Com - Combinatorics, Inf - Information theory, Ana - Mathemati
which occasionally appears in estimates in combinatorics, is defined by
In mathematics, Milliken's tree theorem in combinatorics is a partition theorem generalizing Ramsey
on of the inversion formula more useful in combinatorics is as follows: suppose F(x) and G(x) are c
Extremal combinatorics is a field of combinatorics, which is itse
In combinatorics, Janson has publications in probabilistic
Algorithmic Combinatorics, Macmillan, 1973.
papers in graph theory and other areas of combinatorics, many of them in collaboration with other
Berge, C. (1989), Hypergraphs, Combinatorics of Finite sets, Amsterdam: North-Holland,
Combinatorics of Coxeter Groups (with F. Brenti), Gradua
s numerous contributions to number theory, combinatorics, probability, set theory and mathematical
ch on UNIVAC (this was one of the earliest combinatorics problems solved on a digital computer).
ker (by both the Logic and Foundations and Combinatorics sections) at the Combinatorics session of
Extremal combinatorics studies how large or how small a collectio
ned out to be an important early result in combinatorics, supporting the idea that within some suff
In algebraic combinatorics, the Kruskal-Katona theorem gives a comple
athematics, particularly matrix theory and combinatorics, the Pascal matrix is an infinite matrix c
In algebraic combinatorics, the h-vector of a simplicial polytope is
In combinatorics, the Dinitz conjecture is a statement abou
Count me in - Combinatorics: The Art of Counting (1993)