DOCSLIB.ORG

A Complete Bibliography of Combinatorics, Probability and Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Complete Bibliography of Combinatorics, Probability and Computing A Complete Bibliography of Combinatorics, Probability and Computing Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 14 May 2021 Version 2.28 Title word cross-reference (1; 2) [HJ94]. (5; 5) [CH18]. (7; 4) [Sol15]. (∆ + 1) [BBP21]. (k + 1) [oCM12]. (k − 1) [LW07]. (n; d; λ) [Ofe07]. 0 [BKHL99, VZ06]. 0 <q<1 [Lar21]. 1 [BB12, BKHL99, RM92, VZ06]. 1324 [B´on14]. 2 [BLS+12b, DH00, FS12, FK06, F¨ur12, HZ17, IK09, M´at07, Nob06, Saa96, SS06b, Wu97, Yus07]. 2=3 [KLS+13]. $23.00 [Sco04]. 2k [NV05]. 2 × 2 [Had98, Had99]. 3 [AHL21, CP16, COMV09, EF95, FRV13, FRMZ21, GH17, GS11, HLP+09, HN18, Mar13, Mat03, PRS05, RW01, RRS06, Wag06a, Wu98]. 4 [BHL+15, FR01, KO04a, Mar13, Nag17, SW07a]. $49.95 [B´ar04, Lea04]. 5 [BDLP20]. $65.00 [Sco04]. 7 [Bri98]. 8 [Bri98]. 3;3 [KM12]. b [AF04]. B2[g] + [CV08]. Bh [DKL 16]. β [GA19]. C2k [GMT20]. C2k+1 [GL12b]. C4 [Pic11]. 3 C6 [GH17]. d [BCOK14a, BCOK15, BKW08, KN03, Siv14]. ∆ e − [FK09, KRT99]. ∆=2 [MR95]. [ABFK92]. F [PR17a, Wag00]. F7 [Mec01]. n F7 [Mec01]. Fp [Ngu11]. Fq[x] [Han93]. G [BFRT01, FR15, JT08b]. G(n; p) [Wol11]. Gn;p [CO07b]. GF (q) [Lef05]. H [AY93, AKS05, FJP13]. k 1 2 [Aig05, COGL07, COW18, CF95, CDD03, DHS16, Gao14, GGH12, GJ03, HZ05, Han15, JS20, KKY06, LMMW09, Nik01b, PV13, PS16, Ras19, Rio08, Sha11, Sub00, XY11, oCM12]. K − 4 [HLTZ17]. k = r + 1 [EGM+20]. + r s k = r + 2 [EGM 20]. K [Kri94]. K [Kri94]. K2;s [Dob02a]. K2m;2m [DL14]. + K4 [KM08]. K5 [Tho96a]. KN [Fel17, CH18, Bal01b]. Kp [EHS 94]. Kr+2 [KO04b]. l [FHR09]. Lp [CLS13]. log n=n [Jan99]. M [Pan04, DL14, FD97, Gow96, KN14a, Sta02a]. Z [Gla16, Mun14]. Z2 + d + [BCG 19]. Z [ABC 21, GK04]. ZN [Pon13a]. Zp [Pon13b]. N [BH93, GP97, BKW08, FD97, GGX16, Hal93, KS02, KS04, Mad94, Mad95, Rei02, VS06]. n(6; 6) [BMR99]. n + D − 1 [Ham08a]. n−1 [VS06]. N 2 [Heg96]. O [DKR18]. P7 [Mec01]. q [CST97, FHR09]. r [AH17, BL04b, CKTV11, CFMR96, FT11, Jin92]. r(K3;G) [Bri98]. r + " [KO04b]. s [CFMR96, FK17]. SQS(2v) [GMT94]. t 2 n [GSS96, KK14, KM10, Tok13]. U2;5 [Mec01]. x + y = z [KS06]. Z [VS06]. n Z2 [EZ12]. -Almost-Periodicity [CLS13]. -ary [FD97, Pan04]. -Assignment [LW07]. -Avoiding [B´on14]. -Bases [FK06]. -Bonds [FK09]. -Cancellative [F¨ur12]. -Cliques [Nik01b, PV13]. -Colour [GS11]. -colourable [Sub00]. -Coloured [BLS+12b, KN14a]. -Colouring [CH18, COMV09, Ras19]. -colourings [BBP21]. -Conjecture [Sol15]. -Connected [RW01, Wag06a, Wu97, Wu98, Hal93, Mad94]. -Core [Rio08]. -Cores [oCM12]. -covering [GSS96]. -Cross [FT11]. -Cross-Intersecting [FK17]. -CSP [SS06b]. -cube [VS06]. -Cubes [Rei02]. -Cycle [FR01, KO04a, Mar13]. -Cycles [NV05, BDLP20]. -degenerate [KN03]. -Dimensional [Siv14]. -Edge [Nag17]. -Edge-Coloured [LMMW09, Saa96]. -edge-connected [Mad95]. -Equal [Aig05]. -Extensions [HZ05]. -factorizations [HJ94]. -Factors [FS12, oCM12, GH17, HLTZ17, AY93]. -Free [AKS05, GL12b, PR17a, Pic11, GMT20, Kri94]. -Graph [Mar13]. -Graphs [CKTV11, FRV13, GHZ19, HN18, FRMZ21]. -Hermite [GA19]. -Improper [KM10]. -in [RM92]. -Independence [AF04, EHS+94]. -Independent [BB12, FR15]. -Intersecting [Tok13, BFRT01]. -Intersection [JT08b]. -linked [KKY06, FJP13]. -Matrices [VZ06]. -nets [ABFK92]. -out [RM92]. -Partite [AH17, CKTV11, GHZ19, Jin92]. -Partitions [XY11]. -Polymatroid [Nob06]. -Regular [Gao14, LMMW09, SW07a, CFMR96]. -SAT [COGL07, GJ03, COW18, IK09, EF95]. -Sets [Sha11, BL04b, DKL+16]. -Stirling [CST97]. -subdivisions [Tho96a]. -Subsystems [KRT99]. -Sums [GGX16, GGH12]. -trees [DHS16, JS20]. -Uniform [BCOK14a, BCOK15, CP16, GH17, GS11, Han15, HLP+09, RRS06, AHL21, PRS05, CFMR96]. -Vectors [VZ06, Wag00]. -Wide [FHR09]. -wise [Gow96]. -XOR-formulas [CDD03]. -XORSAT [PS16]. 0-521-52903-4 [Sco04]. 0-521-82151-7 [Sco04]. 3 139.05/$159.00 [Bov04]. 14-Cycle-Free [FO09].¨ 15.99/$24.99 [Ber06]. 152pp [Ber06]. 170pp [B´ar06]. 1995 [Ano99]. 2011 [SSS+11]. 257pp [Big07, Ode06]. 29.00/$49.95/38 [Ode06]. 3 [Lea04]. 3-540-00845-4 [Ste05b]. 3-540-66313-4 [Lea04]. 3-Connected [FP11]. 3-Uniform [Gow06]. 32.50 [Lea04]. 377pp [Geo08]. 4 [Lea04]. 40.00/$70.00 [Ber06]. 455pp [Moh06]. 49.95 [B´ar04]. 50.00/$95.00 [Big07]. 6-Cycles [WL01]. 61.50/$99.00/79.95 [Dud07]. 61.50/EU [McM05]. 69 [Hol04]. 69.00/$125.00/89.95 [Geo08]. 73.00/$109.00 [Ste05b]. 73.00/$109.00/94.95 [Moh06]. 85.55/$79.97 [McM05]. 85d [Die95]. 94.95/$ [Ste05b]. 99m [Had99]. Abelian [BNMS15, GH98, GGX16, GGH12, HLW19, Peb04]. Absence [Bor06]. Academic [Big07]. Achlioptas [RW16c]. Active [AHW16]. Acyclic [Bor04, Pik10, RT05]. Adaptive [CO10]. Addability [MW17]. Addable [ABMR12]. Adding [BJJ98, Ham98, KN16, Baj16]. Addition [HHP07]. Additive [BH93, Cha07, DLM04, Wag15, RW19]. adjacency [God92]. adsorption [FP92]. Advantage [AHK10]. Adversarial [BKT13, FFV07a]. Affine [GR98, HP97, HS04, Mun14]. After [BKT13]. against [FKR+03]. Albert [M´or05]. Alexander [Moh06]. Algebra [Pik01]. Algebraic [BD15, Big07, FHR09, HS98, PD17]. algebras [ESS94]. Algorithm [DV04, DFV97, DKM+15, KP98, Vu18, Ann94, AST93, DFK+93, FLZ19, FRS95, Pit93]. Algorithmic [BLGN+02, FLZ17, FLZ18, Van01, Voi00]. Algorithms [CTV15, DP06, DS04, FFV07b, GG10, HS00a, LS18a, PV19, PWZ97, Sub00, Sub07, GJ03, NT93]. Allocation [SV03]. Allocations [DLM04, Mit99]. Almost [BKT13, CC98, CLS13, DL14, Ell11, FFO13, KM08, KMS19, MR95, Mil17, Pel94, PS92, Edw95, Gow96, Gub96, SC95]. Almost-Equidistant [KMS19]. almost-planar [Gub96]. almost-transitive [SC95]. Alon [Nao12]. Along [Can09]. Alspach [Bal01a]. Alternating [Mon14, Saa96]. alternation [Con20]. Alternative [DP15]. Amalgamated [DH94]. Amenable [BPP06]. Amidst [DJ13]. among [MS95, Mat95, Mat99]. Anagram [KLS18]. Anagram-Free [KLS18]. analogue [Law93]. Analyse [LCF14]. Analysing [COMV09]. Analysis [ACG+04, ADH+19, BD08, CP20, CTV15, DV04, DFV97, DO14, DFP92, DS04, FRS95, GLWW15, 4 GKW14, HK14, KP11, KP19, LS18a, MM14, Ode06, PV19, PWZ97, LS95]. Analytic [Man02b]. And/Or [CFGG04]. Andrews [Ber06]. Angel [M´at07, Bow07]. Animals [MS13]. Annealing [NS01]. Answer [HHP07]. Ante [Csi92, Sta95]. Anti [HT16, AJT03, JW03, JLM+03]. anti-Ramsey [AJT03, JW03, JLM+03]. Anti-Triangles [HT16]. Antiferromagnetic [GSV16]. Apart [SS07]. Appearances [CPV01]. Application [AM10, BLGN+02, FM14, MW07, Fra21, Pud03]. Applications [Alo09b, Big07, FRV13, FP10, FP14, FLZ17, FG08, KS18, Lea04, Moh06, SV03, Sie98, Esl21, Fil20, FLZ18]. applied [GJ03]. Approach [AvLR13, COMV09, EGPN16, Hol04, Kah01, LM19, LM01, Man02b, Mar01, Alo92, DT94, Lyn93]. approaches [Ing93]. Approximate [BFLW05, ABIST96, LP20]. Approximately [FK14, GJ21]. Approximating [Bor04, CDD03, Tim12, DFK+93, Ver95]. Approximation [Bor02, CPV01, Dub08, ER99, FFV07b, M˚an00, WF11, Ann94, GJ03, NT93, Wel94]. Approximations [ABT06, Fuc08, Sta97, Sta99b, ZD08, GSS96]. Arbitrary [Ham11, Yus04, Con20]. Arboricity [AHHT10]. Arc [BGLS04, CTY07, HMS+13, SV03, Hir97b]. Arc-sine [Hir97b]. Arcs [BJGY97, BJJ98, RT05]. Area [SRT10, The04]. areas [Tho92]. Argyros [Ode06]. Arising [GLWW15, HZ14]. Arithmetic [Can09, CLS13, Ngu11, Sol06, Ver00, JLM+03, RSW93]. armed [FKR+03]. arrangement [KR94]. Arrangements [B´ar06]. Arratia [Hol04]. Arrays [ACO13,¨ KS15, GSS96]. ary [FD97, Pan04]. Ascents [BKW08]. Ashkin [Far07]. Aspects [Van01, Voi00, CK93]. Assemblies [Sta97, Sta99b]. Assignment [AS02, LW07, Par04, W¨as11]. Assignments [COW18, EES03]. Associate [FR01]. Associated [ADH+19, HKL+20, VW93]. association [Bie19]. Asymmetric [DMS19, HK14, MNS20]. Asymmetry [BCGR97]. Asymptotic [BP12, BCOK14a, BCOK15, BHLB+13, BMW14, Cha09, Coo96, GKW14, Had98, Lyo05, MR98a, MWW02, Mon18, PR17b, Had99, Jan95, LSM19]. asymptotical [Lis96]. Asymptotically [BK16, Kuz00, Thi16, M´or92]. Asymptotics [BD15, BP01, GHO17, HM15, Mub02, PW04, Pim11, Sta99b, Wil15, GA19]. Attachment [AMR16, BBC+05, DO14, Jan19]. Author [Ano92a, Ano93a, Ano94a, Ano95a, Ano96a]. Autocorrelation [Eri97]. Autocorrelations [Mer06]. Automata [BSU15]. Automorphism [Dob06, Leh13, Sch02]. Automorphisms [Bon95, FGLP00, Sco04]. Average [Alm06, DFV97, FFV07b, KO04b, LV18, Mos98, Rei03, Teu03]. Average-Case [DFV97]. Avoidance [BS19, Fel17, M˚an02a]. Avoiding [ACO13,¨ AM14, BJGY97, B´on14, BM14b, EGM+20, Eri97, HKL12, Jan17, MW05a, Alm93, HS95, Pin20]. Azuma [Nao12]. B [Die95, FS20]. Back [Ano92b, Ano92d, Ano92f, Ano92h, Ano93b, Ano93d, Ano93f, Ano93h, Ano94b, Ano94d, Ano94f, Ano94h, Ano95b, Ano95d, Ano95f, Ano95h, Ano96b, Ano96d, Ano96f, Ano96h, Ano09a, Ano09c, 5 Ano09d, Ano09g, Ano09h, Ano09k, Ano09l, Ano09o, Ano10a, Ano10c, Ano10e, Ano10g, Ano10i, Ano11a, Ano11c, Ano11e, Ano11g, Ano11i, Ano11k, Ano12a, Ano12c, Ano12e, Ano12g, Ano12i, Ano13a, Ano13c, Ano13e, Ano13g, Ano13i, Ano13k, Ano14a, Ano14c, Ano14e, Ano14g, Ano14i, Ano14k, Hir97a]. Balanced [GHH06, Mit99]. Ball [LM19]. Balls [Oli08]. Balls-in-Bins [Oli08]. Banach [Nao12]. Banach-Space-Valued [Nao12]. bandit [FKR+03]. Bandwidth [KT13]. Barab´asi [M´or05]. Barbour [Hol04]. Barely [BBW14]. barrier [BB19]. Barycentric [DM11]. Based [LM01]. Bases [FK06, GJ21, Sch94]. Basis [Sey99]. Bat [BKL+06]. be [DH00, KKY06, MR95]. Beck [Buk16, Fra21]. behavior [Pit93]. Beineke [Big07]. Belief [COMV09]. Below [Lo09]. Berg [Rei00]. Berge [Bah12, BBDS21, EGM+20, GS11, PS92]. Berge-Johnson [Bah12]. Bernoulli [BCV16, Hub16]. Berry [Fuc08]. Best [KLM02, Pau06]. Beta [DKW14]. Beta-Coalescents [DKW14]. Bethe [WF11]. Better [XY11]. Between [ESS09, KS09, PS98, RS18, SSZ15]. Betweenness [Goe10]. Bias [May05]. Biased [Bed98, GRS20]. Biasing [FG11]. Bicircular [GN06,
Load more

Recommended publications
  • On the Site Percolation Threshold of Circle Packings and Planar Graphs
    ON THE SITE PERCOLATION THRESHOLD OF CIRCLE PACKINGS AND PLANAR GRAPHS RON PELED Abstract. A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists p > 0 such that the following holds for every circle packing: If each disk is retained with probability p independently, then the probability that there is a path of retained disks connecting the origin to infinity is zero. The following conclusions are derived using results on circle packings of planar graphs: (i) Site percolation with parameter p has no infinite connected component on recurrent simple plane triangulations, or on Benjamini{Schramm limits of finite simple planar graphs. (ii) Site percolation with parameter 1−p has an infinite connected component on transient simple plane triangulations with bounded degree. These results lend support to recent conjectures of Benjamini. Extensions to graphs formed from the packing of shapes other than disks, in the plane and in higher dimensions, are presented. Several conjectures and open questions are discussed. 1. Introduction Site percolation with parameter p 2 [0; 1] on a graph G is the process of independently retaining each vertex in G with probability p and deleting it with probability 1 − p; the (random) induced subgraph on the retained vertices is denoted Gp. Percolation theory is concerned with the structure of the connected components of Gp. It forms a huge body of research in both the physics and mathematics communities; see [16, 22, 26] for two books and a recent review. Possibly the most basic question in the theory is whether Gp has a connected component with infinitely many vertices.
    [Show full text]
  • Three Puzzles on Mathematics, Computation, and Games
    THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES GIL KALAI HEBREW UNIVERSITY OF JERUSALEM AND YALE UNIVERSITY ABSTRACT. The second puzzle is about errors made when votes are counted during elections. 1. INTRODUCTION The theory of computing and computer science as a whole are precious resources for mathematicians. They bring new questions, new profound ideas, and new perspectives on classical mathematical ob- jects, and serve as new areas for applications of mathematics and of mathematical reasoning. In my lecture I will talk about three mathematical puzzles involving mathematics and computation (and, at times, other fields) that have preoccupied me over the years. The connection between mathematics and computing is especially strong in my field of combinatorics, and I believe that being able to per- sonally experience the scientific developments described here over the last three decades may give my description some added value. For all three puzzles I will try to describe with some detail both the large picture at hand, and zoom in on topics related to my own work. Puzzle 2: What are methods of election that are immune to errors in the counting of votes? The second puzzle can be seen in the context of understanding and planning of electoral methods. We all remember the sight of vote recount in Florida in the 2000 US presidential election. Is the American electoral system, based on electoral votes, inherently more susceptible to mistakes than the majority system? And what is the most stable method? Together with Itai Benjamini and Oded Schramm we investigated these and similar problems. We asked the following question: given that there are two Work supported in part by ERC advanced grant 320924, BSF grant 2006066, and NSF grant DMS-1300120.
    [Show full text]
  • Around Two Theorems and a Lemma by Lucio Russo
    NISSUNA UMANA INVESTIGAZIONE SI PUO DIMANDARE VERA SCIENZIA S’ESSA NON PASSA PER LE MATEMATICHE DIMOSTRAZIONI LEONARDO DA VINCI vol. 6 no. 2 2018 Mathematics and Mechanics of Complex Systems ITAI BENJAMINI AND GIL KALAI AROUND TWO THEOREMS AND A LEMMA BY LUCIO RUSSO msp MATHEMATICS AND MECHANICS OF COMPLEX SYSTEMS Vol. 6, No. 2, 2018 dx.doi.org/10.2140/memocs.2018.6.69 ∩ MM AROUND TWO THEOREMS AND A LEMMA BY LUCIO RUSSO ITAI BENJAMINI AND GIL KALAI We describe two directions of study following early work of Lucio Russo. The first direction follows the famous Russo–Seymour–Welsh (RSW) theorem. We describe an RSW-type conjecture by the first author which, if true, would imply a coarse version of conformal invariance for critical planar percolation. The second direction is the study of “Russo’s lemma” and “Russo’s 0–1 law” for threshold behavior of Boolean functions. We mention results by Friedgut, Bour- gain, and Hatami, and present a conjecture by Jeff Kahn and the second author, which may allow applications for finding critical probabilities. 1. Introduction We have not met Lucio Russo in person but his mathematical work has greatly influenced our own and his wide horizons and interests in physics, mathematics, philosophy, and history have greatly inspired us. We describe here two directions of study following early work of Russo. The first section follows the famous Russo–Seymour–Welsh theorem regarding critical planar percolation. The second section follows the basic “Russo’s lemma” and the deep “Russo’s 0–1 law”. In each direction we present one central conjecture.
    [Show full text]
  • Three Puzzles on Mathematics, Computation, and Games
    THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES GIL KALAI HEBREW UNIVERSITY OF JERUSALEM AND YALE UNIVERSITY ABSTRACT. In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear programming. The second puzzle is about errors made when votes are counted during elections. The third puzzle is: are quantum computers possible? 1. INTRODUCTION The theory of computing and computer science as a whole are precious resources for mathematicians. They bring new questions, new profound ideas, and new perspectives on classical mathematical ob- jects, and serve as new areas for applications of mathematics and of mathematical reasoning. In my lecture I will talk about three mathematical puzzles involving mathematics and computation (and, at times, other fields) that have preoccupied me over the years. The connection between mathematics and computing is especially strong in my field of combinatorics, and I believe that being able to per- sonally experience the scientific developments described here over the last three decades may give my description some added value. For all three puzzles I will try to describe with some detail both the large picture at hand, and zoom in on topics related to my own work. Puzzle 1: What can explain the success of the simplex algorithm? Linear programming is the problem of maximizing a linear function φ subject to a system of linear inequalities. The set of solutions for the linear inequalities is a convex polytope P (which can be unbounded).
    [Show full text]