9,711 Hits in 3.9 sec

Page 1835 of Mathematical Reviews Vol. , Issue 86e [page]

1986 Mathematical Reviews  
COMBINATORICS 86e:05011 Odlyzko, A. M. (1-BELL); Richmond, L. B. 86e:05007 (3-WTRL-B) On the number of distinct block sizes in partitions of a set. J. Combin. Theory Ser. A 38 (1985), no. 2, 170-181.  ...  Niederhausen, Heinrich (1-AZS) The combinatorics of records. Proceedings of the fifteenth Southeastern conference on combinatorics, graph theory and computing (Baton Rouge, La., 1984). Congr.  ... 

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions

Juha Kortelainen
2011 Electronic Proceedings in Theoretical Computer Science  
Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet.  ...  In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant.  ...  Introduction In combinatorics on words, the theory of 'unavoidable regularities' usually concerns properties of long words over a fixed finite alphabet.  ... 
doi:10.4204/eptcs.63.4 fatcat:hz24t7ui5jbqhe7bixpibotyca

A Note on Divisibility of the Number of Matchings of a Family of Graphs

Kyung-Won Hwang, Naeem N. Sheikh, Stephen G. Hartke
2009 Electronic Journal of Combinatorics  
In this note we prove this conjecture.  ...  For a certain graph obtained by adding extra vertices and edges to the triangular lattice graph, Propp conjectured that the number of perfect matchings of such a graph is always divisible by $3$.  ...  We also thank the anonymous referee for improvements, and for pointing out Doug Lepro's work and the work by Pachter.  ... 
doi:10.37236/248 fatcat:tlep72ufhzbthnfkyrtcg5hnqy

Page 49 of Mathematical Reviews Vol. , Issue 97A [page]

1997 Mathematical Reviews  
{The papers are being reviewed individually. } 97a:05010 05-06 * Proceedings of the 5th Conference on Formal Power Series and Algebraic Combinatorics.  ...  Odlyzko, Analytic methods in asymptotic enumeration (229-238); Giuseppe Pirillo and Stefano Varricchio, Some combi- natorial properties of infinite words and applications to semigroup theory (239-251);  ... 

On the structure and extendibility of k-power free words

James D Currie
1995 European journal of combinatorics (Print)  
The branching of the tree of k-power free words is explored.  ...  It is shown that the set of k-power free aJ-words over Z is perfect if k > 6 and IZI > 1, if k > 3 and IZI > 2, if k > 2 and IZI > 3, or if k > 1 and 1271 > 4.  ...  ACKNOWLEDGEMENTS The author wishes to thank the anonymous referee, who made very helpful suggestions concerning the presentation of the paper. This work was supported by an NSERC operating grant.  ... 
doi:10.1016/0195-6698(95)90051-9 fatcat:t7zjlihtqfd5jkoyusidkownba

Page 3173 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
Our method relies on a Capelli-type identity for the Schur-Weyl duality and on the study of ‘polynomial functions’ on the set Y of Young diagrams.”  ...  This paper is concerned with block-transitive, point-imprimitive t-(v,k,A) designs for fixed t, v and k but with no restriction on A.  ... 

Page 776 of Mathematical Reviews Vol. , Issue 97B [page]

1997 Mathematical Reviews  
(NL-EIND; Eindhoven) Block designs. Handbook of combinatorics, Vol. 1,2, 693-745, Elsevier, Amsterdam, 1995. The author gives a brief but useful survey on ¢-designs.  ...  It is a classical problem in combinatorics to enumerate the number of involutions without fixed points, according to the number of pairs of cycles (i,k) and (j,/) such that | <i< j<k</<2n. J.  ... 

One-Factorizations of Regular Graphs of Order 12

Petteri Kaski, Patric R. J. Östergård
2005 Electronic Journal of Combinatorics  
Some properties of the classified one-factorizations are also tabulated.  ...  The smallest open case is currently graphs of order 12; one-factorizations of $r$-regular graphs of order 12 are here classified for $r\leq 6$ and $r=10,11$.  ...  In the preprocessing stage, we fix the first block, {u 1 , v 1 , v 2 }, and construct all pairwise nonisomorphic triple systems consisting of blocks that intersect the first block.  ... 
doi:10.37236/1899 fatcat:5q5jsk54nreqjiizqzyws3ppve

Page 2544 of Mathematical Reviews Vol. , Issue 84g [page]

1984 Mathematical Reviews  
Keedwell (Guildford) Lothaire, M. 84g:05002 * Combinatorics on words.  ...  ISBN 0-201-13516-7 From the preface: “This book is the first attempt to present a unified treatment of the theory of combinatorics on words.  ... 

Page 4546 of Mathematical Reviews Vol. , Issue 96h [page]

1996 Mathematical Reviews  
D is contained in precisely one block of each class.  ...  Summary: “Ternary designs with block size three or an even number and with replication numbers all but two of the values in the range A(V —1)/(K —1) to A(V —1)/(K —2) are constructed.  ... 

Page 7608 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
, TX) Improved bounds on the length of maximal abelian square-free words.  ...  In this paper, we refine Korn’s methods to show that 6k — 29 < /(k) < 6k — 12 for k > 8.”  ... 

Permutations with Ascending and Descending Blocks

Jacob Steinhardt
2010 Electronic Journal of Combinatorics  
We then provide the first bijective proofs of some known results. We also extend the work of Eriksen, Freij, and Wästlund, who study derangements that descend in blocks of prescribed lengths.  ...  To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks.  ...  of combinatorics 17 (2010), #R14 the electronic journal of combinatorics 17 (2010), #R14 Now consider the vector space homomorphism FIX : C[S n ] → C[λ] defined on elements of S n as FIX(π) = λ |fix(  ... 
doi:10.37236/286 fatcat:p6gvehjcqnchji27tu3u6eg2ty

Page 3762 of Mathematical Reviews Vol. , Issue 86h [page]

1986 Mathematical Reviews  
A fixing block of period n in an overlap-free word is a square rz with z of length n.  ...  Results: Each fixing block has length 2* or 3-2*. To each fixing block is associated a chain, whose length is 3-2*-! —1 for a fixing block of length 2*, and 2*+! — 1 otherwise.  ... 

Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)

Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Dimitrios M. Thilikos, Marc Herbstritt
2013 Dagstuhl Reports  
We provide a report on the Dagstuhl Seminar 13121: Bidimensional Structures: Algorithms, Combinatorics and Logic held at Schloss Dagstuhl in Wadern, Germany between Monday 18 and Friday 22 of March 2013  ...  The report contains the motivation of the seminar, the abstracts of the talks given during the seminar, and the list of open problems. Seminar 18.-22. March, 2013  ...  Then a dynamic programming algorithm for Planar Completion to Bounded Diameter on graphs of bound treewidth would result in the construction of the desired algorithm.  ... 
doi:10.4230/dagrep.3.3.51 dblp:journals/dagstuhl-reports/DemaineFHT13 fatcat:vbtdm45hovds5eyorghjbz4kr4

The reflection representation in the homology of subword order

Sheila Sundaram
2021 Algebraic Combinatorics  
We uncover a curious duality in homology in the case when one rank is deleted.  ...  on the set Our most definitive result describes the Frobenius characteristic of the homology for an arbitrary set of ranks, plus or minus one copy of the Schur function s (n−1,1) , as an integer combination  ...  The author is grateful to the anonymous reviewers for their detailed and valuable comments.  ... 
doi:10.5802/alco.184 fatcat:c543qpbckrhszgoxpwbfxvikzm
« Previous Showing results 1 — 15 out of 9,711 results