Sciweavers

Share
JCT
2011
90views more  JCT 2011»
9 years 4 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
JCT
2011
86views more  JCT 2011»
9 years 4 months ago
Descendant-homogeneous digraphs
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
Daniela Amato, John K. Truss
JCT
2011
57views more  JCT 2011»
9 years 4 months ago
Generalized Stirling permutations, families of increasing trees and urn models
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the c...
Svante Janson, Markus Kuba, Alois Panholzer
JCT
2011
84views more  JCT 2011»
9 years 4 months ago
Explicit separating invariants for cyclic P-groups
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
Müfit Sezer
JCT
2011
66views more  JCT 2011»
9 years 4 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
JCT
2011
115views more  JCT 2011»
9 years 4 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
JCT
2011
91views more  JCT 2011»
9 years 4 months ago
On a generalisation of the Dipper-James-Murphy conjecture
Let r, n be positive integers. Let e be 0 or an integer bigger than
Jun Hu
JCT
2011
104views more  JCT 2011»
9 years 4 months ago
Bounds for solid angles of lattices of rank three
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Lenny Fukshansky, Sinai Robins
JCT
2011
83views more  JCT 2011»
9 years 4 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
JCT
2011
85views more  JCT 2011»
9 years 4 months ago
Substitution-closed pattern classes
The substitution closure of a pattern class is the class of all permutations obtained by repeated substitution. The principal pattern classes (those defined by a single restricti...
M. D. Atkinson, Nikola Ruskuc, Rebecca Smith
books