Sciweavers

365 search results - page 7 / 73
» On the combinatorics of Galois numbers
Sort
View
67
Voted
COMBINATORICS
2006
97views more  COMBINATORICS 2006»
14 years 11 months ago
H-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andr
Noga Alon, Benny Sudakov
ACMMPC
2000
Springer
231views Mathematics» more  ACMMPC 2000»
15 years 4 months ago
Galois Connections and Fixed Point Calculus
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
Roland Carl Backhouse
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
14 years 11 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
14 years 11 months ago
Dominance Order and Graphical Partitions
We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to ...
Axel Kohnert
COMBINATORICS
2000
79views more  COMBINATORICS 2000»
14 years 11 months ago
Some Bijective Correspondences Involving Domino Tableaux
We define a number of new combinatorial operations on skew semistandard domino tableaux that complement constructions defined by C. Carr
Marc A. A. van Leeuwen