Sciweavers

3356 search results - page 120 / 672
» Determining Consensus Numbers
Sort
View
JSYML
2007
85views more  JSYML 2007»
13 years 10 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes
ENDM
2002
107views more  ENDM 2002»
13 years 10 months ago
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
Tao Jiang, Douglas B. West
MOC
2000
79views more  MOC 2000»
13 years 9 months ago
On fundamental domains of arithmetic Fuchsian groups
Let K be a totally real algebraic number field and O an order in a quaternion algebra A over K. Assume that the group O1 of units in O with reduced norm equal to 1 is embedded into...
Stefan J. Johansson
DM
1999
62views more  DM 1999»
13 years 9 months ago
Directed animals, forests and permutations
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...
DM
1999
61views more  DM 1999»
13 years 9 months ago
Some codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X a...
Yves Edel, Jürgen Bierbrauer