Building Diamond-free Posets
|
|
- Patricia Harvey
- 5 years ago
- Views:
Transcription
1 Aaron AMS Southeastern Sectional October 5, 2013 Joint with Éva Czabarka, Travis Johnston, and László Székely
2 The Diamond Conjecture is False Aaron AMS Southeastern Sectional October 5, 2013 Joint with Éva Czabarka, Travis Johnston, and László Székely The Diamond Conjecture is False
3
4 Aaron AMS Southeastern Sectional October 5, 2013 Joint with Éva Czabarka, Travis Johnston, and László Székely
5
6 Two Interesting Posets In B 8 : Take the size 5 level, the size 3 level
7 Two Interesting Posets In B 8 : Take the size 5 level, the size 3 level and an S(3, 4, 8) Steiner system on the size 4 level.
8 Two Interesting Posets In B 8 : Take the size 5 level, the size 3 level and an S(3, 4, 8) Steiner system on the size 4 level. No Diamonds! (Steiner)
9 Two Interesting Posets In B 8 : Take the size 5 level, the size 3 level and an S(3, 4, 8) Steiner system on the size 4 level. No Diamonds! (Steiner) Same number of sets as the two largest levels.
10 Two Interesting Posets In B 12 : Take the size 7 level, the size 5 level and an S(5, 6, 12) Steiner system on the size 6 level. No Diamonds! (Steiner) Same number of sets as the two largest levels.
11 Two Interesting Posets This works for any B 2d, if there s an S(d 1, d, 2d). But no Steiner system is know with t > 5.
12 Two Interesting Posets This works for any B 2d, if there s an S(d 1, d, 2d). But no Steiner system is know with t > 5. Plus,
13 Cayley Posets Abelian Group Γ, Generating set H, and its Digraph D.
14 Cayley Posets Abelian Group Γ, Generating set H, and its Digraph D. Copy the group, edges in D become covers.
15 Cayley Posets Abelian Group Γ, Generating set H, and its Digraph D. Copy the group, edges in D become covers. Repeat in both directions. Any finite subposet of this is a Cayley Poset.
16 Some Definitions A Cayley Poset... is aperiodic if gcd{k h 1 + h h k = 0, h i H} = 1.
17 Some Definitions A Cayley Poset... is aperiodic if gcd{k h 1 + h h k = 0, h i H} = 1. has a strong chain if there are (g 1, i 1 ) < (g 2, i 2 ) < (g 3, i 3 ), where g 2 g 1 = i 2 i 1 j=1 h j and g 3 g 2 = i 3 i 2 j=1 h j can be written sharing a common term.
18 Some Definitions A Cayley Poset... is aperiodic if gcd{k h 1 + h h k = 0, h i H} = 1. has a strong chain if there are (g 1, i 1 ) < (g 2, i 2 ) < (g 3, i 3 ), where g 2 g 1 = i 2 i 1 j=1 h j and g 3 g 2 = i 3 i 2 j=1 h j can be written sharing a common term. is strongly diamond-free if it has no diamonds, and no strong chains.
19 Back to B n Assign an element from H to each element of [n]. w : [n] H. Extend linearly to subsets A [n].
20 Back to B n Assign an element from H to each element of [n]. w : [n] H. Extend linearly to subsets A [n]. For an element g Γ and i N, S g (i) = {A : w(a) = g and A = n/2 + i}.
21 Back to B n If w is a weighting, and P = {(g j, i j )} is a Cayley poset with l elements, there s a family of sets F(n, w, P) = l S gj (i j ) j=1
22 Back to B n If w is a weighting, and P = {(g j, i j )} is a Cayley poset with l elements, there s a family of sets F(n, w, P) = l S gj (i j ) j=1 Lemma If P is strongly diamond free, then F(n, w, P) is diamond free.
23 Back to B n If w is a weighting, and P = {(g j, i j )} is a Cayley poset with l elements, there s a family of sets F(n, w, P) = l S gj (i j ) j=1 Lemma If P is strongly diamond free, then F(n, w, P) is diamond free. If we can find good weights, and good posets, we have interesting examples!
24 Random is Good Instead of assigning weights, let them be random variables. { 1/ H if g H P[w(x) = g] =. 0 o/w
25 Random is Good Instead of assigning weights, let them be random variables. { 1/ H if g H P[w(x) = g] =. 0 o/w For a A [n], consider finding w(a) as a Markov process, adding the weight of each element to a running total.
26 An Old Theorem Theorem For any group G, and H G, if H generates G, and is not contained in some coset of a normal subgroup, the (infinite) Markov process described is irreducible, aperiodic, and converges to the uniform distribution on G.
27 An Old Theorem Theorem For any group G, and H G, if H generates G, and is not contained in some coset of a normal subgroup, the (infinite) Markov process described is irreducible, aperiodic, and converges to the uniform distribution on G. Aperiodic Cayley posets have these properties! Hence for n large, i fixed, for all g and A = n/2 + i 1/ G ɛ P[w(A) = g] 1/ G + ɛ
28 An Old Theorem Theorem For any group G, and H G, if H generates G, and is not contained in some coset of a normal subgroup, the (infinite) Markov process described is irreducible, aperiodic, and converges to the uniform distribution on G. Aperiodic Cayley posets have these properties! Hence for n large, i fixed, for all g and A = n/2 + i 1/ G ɛ E ( S g(i) ) ) 1/ G + ɛ ( n n/2 +i
29 A New Result Note that if P is strongly diamond free, l j=1 S g j (i j ) = F(n, w, P) La(n, D 2 ).
30 A New Result Note that if P is strongly diamond free, l j=1 S g j (i j ) = F(n, w, P) La(n, D 2 ). Theorem If G is an abelian group with G = m and an aperiodic generating set H, and P is a strongly diamond-free Cayley poset with l elements, l m = lim n E [ F(n, w, P) ] ) lim inf ( n n/2 n La(n, D 2 ) ). ( n n/2
31 A New Result Note that if P is strongly diamond free, l j=1 S g j (i j ) = F(n, w, P) La(n, D 2 ). Theorem If G is an abelian group with G = m and an aperiodic generating set H, and P is a strongly diamond-free Cayley poset with l elements, l m = lim n E [ F(n, w, P) ] ) lim inf ( n n/2 n La(n, D 2 ) ). ( n n/2 A single Cayley poset with l > 2m would refute the diamond conjecture...
32 No Counterexamples Back in the infinite poset,
33 No Counterexamples Back in the infinite poset, Keep one generator.
34 No Counterexamples Back in the infinite poset, Keep one generator. Avoiding strong chains forces l 2m.
35 But Some Examples Example 1: l = 2m Any group, any generating set, and two levels (this is not interesting)...
36 But Some Examples Example 2: l = 2m Z m, H is two elements with gcd(a, b) = 1. (g, 3) : g a + b (a, 2), (b, 2) (g, 1) : g 0 (sometimes periodic...)
37 But Some Examples Example 3: l = 2m 1 Z 7, generators H = {2, 3, 5} (g, 3) : g 0, 1, 5 (2, 2), (3, 2), (5, 2) (g, 1) : g 0
38 But Some Examples Example 4: l = 2m 2 Z 4k+1, generators H = {2k, 2k + 1} (g, 4) : g = k + 2, k + 3,... 3k 2, (g, i) : g = k, k + 1,..., 3k, and i = 1, 2, 3 This is on four levels, and can be made as tight to the conjecture as desired.
39 The Last Slide Can this be used for other forbidden posets? Find conditions on the Cayley poset for what you want.
40 The Last Slide Can this be used for other forbidden posets? Find conditions on the Cayley poset for what you want. Can we show that there are always distant outliers in the expectation? (or any?)
41 The Last Slide Can this be used for other forbidden posets? Find conditions on the Cayley poset for what you want. Can we show that there are always distant outliers in the expectation? (or any?) Is there a single diamond-free poset with more than the largest two levels worth of elements?
42 Thanks! For the full paper, go to the arxiv:
Packing posets in a family of subsets
Andrew P. Dove Jerrold R. Griggs University of South Carolina Columbia, SC 29208 October 5, 2013 B n is the inclusion poset of all subsets of {1, 2,..., n}. Definition (La(n, P)) The quantity La(n, P)
More informationPacking Posets in the Boolean Lattice
page.1... Packing Posets in the Boolean Lattice Andrew P. Dove Jerrold R. Griggs University of South Carolina Columbia, SC USA SIAM-DM14 Conference Minneapolis page.2 Andrew Dove page.3 Andrew Dove Jerry
More informationResearch Statement. Shanise Walker
Research Statement Shanise Walker Extremal combinatorics is a field at the heart of mathematics. It studies how large or small certain parameters of discrete structures can be if other parameters are given.
More informationPoset-free Families of Sets
Poset-free Families of Sets... Jerrold R. Griggs Wei-Tian Li Linyuan Lu Department of Mathematics University of South Carolina Columbia, SC USA Combinatorics and Posets Minisymposium SIAM-DM12 Halifax,
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationOne-sided shift spaces over infinite alphabets
Reasoning Mind West Coast Operator Algebra Seminar October 26, 2013 Joint work with William Ott and Mark Tomforde Classical Construction Infinite Issues New Infinite Construction Shift Spaces Classical
More informationHamiltonian circuits in Cayley digraphs. Dan Isaksen. Wayne State University
Hamiltonian circuits in Cayley digraphs Dan Isaksen Wayne State University 1 Digraphs Definition. A digraph is a set V and a subset E of V V. The elements of V are called vertices. We think of vertices
More informationMARKOV MODEL WITH COSTS In Markov models we are often interested in cost calculations.
MARKOV MODEL WITH COSTS In Markov models we are often interested in cost calculations. inventory model: storage costs manpower planning model: salary costs machine reliability model: repair costs We will
More informationII. Products of Groups
II. Products of Groups Hong-Jian Lai October 2002 1. Direct Products (1.1) The direct product (also refereed as complete direct sum) of a collection of groups G i, i I consists of the Cartesian product
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationOn families of subsets with a forbidden subposet
On families of subsets with a forbidden subposet Linyuan Lu lu@math.sc.edu. University of South Carolina Joined work with Jerry Griggs On families of subsets with a forbidden subposet p./ Poset A poset
More informationMATH 420 FINAL EXAM J. Beachy, 5/7/97
MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only
More informationSemiregular automorphisms of vertex-transitive cubic graphs
Semiregular automorphisms of vertex-transitive cubic graphs Peter Cameron a,1 John Sheehan b Pablo Spiga a a School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1
More informationMarkov chains. Randomness and Computation. Markov chains. Markov processes
Markov chains Randomness and Computation or, Randomized Algorithms Mary Cryan School of Informatics University of Edinburgh Definition (Definition 7) A discrete-time stochastic process on the state space
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationLecture 21. David Aldous. 16 October David Aldous Lecture 21
Lecture 21 David Aldous 16 October 2015 In continuous time 0 t < we specify transition rates or informally P(X (t+δ)=j X (t)=i, past ) q ij = lim δ 0 δ P(X (t + dt) = j X (t) = i) = q ij dt but note these
More informationTHE AUTOMORPHISM GROUP OF A SHIFT OF SLOW GROWTH IS AMENABLE
THE AUTOMORPHISM GROUP OF A SHIFT OF SLOW GROWTH IS AMENABLE VAN CYR AND BRYNA KRA Abstract. Suppose (X, σ) is a subshift, P X (n) is the word complexity function of X, and Aut(X) is the group of automorphisms
More informationWe begin with some definitions which apply to sets in general, not just groups.
Chapter 8 Cosets In this chapter, we develop new tools which will allow us to extend to every finite group some of the results we already know for cyclic groups. More specifically, we will be able to generalize
More informationMath 430 Exam 2, Fall 2008
Do not distribute. IIT Dept. Applied Mathematics, February 16, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 430 Exam 2, Fall 2008 These theorems may be cited at any time during the test
More informationDraft. Additive properties of sequences on semigroups. Guoqing Wang Tianjin Polytechnic University Home.
Additive properties of sequences on semigroups Guoqing Wang Tianjin Polytechnic University E-mail: gqwang1979@aliyun.com Page Page 1 of 35 Two starting additive researches in group theory For any finite
More informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationThe Theory behind PageRank
The Theory behind PageRank Mauro Sozio Telecom ParisTech May 21, 2014 Mauro Sozio (LTCI TPT) The Theory behind PageRank May 21, 2014 1 / 19 A Crash Course on Discrete Probability Events and Probability
More informationOn non-hamiltonian circulant digraphs of outdegree three
On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA
More informationTurán Problems on Non-uniform Hypergraphs. Jeremy Travis Johnston. Bachelor of Science University of Nebraska-Lincoln 2009
Turán Problems on Non-uniform Hypergraphs by Jeremy Travis Johnston Bachelor of Science University of Nebraska-Lincoln 009 Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor
More informationSection II.1. Free Abelian Groups
II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof
More informationThe diameter of a random Cayley graph of Z q
The diameter of a random Cayley graph of Z q Gideon Amir Ori Gurel-Gurevich September 4, 009 Abstract Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators.
More informationThe Saturation Number of Induced Subposets of the Boolean Lattice
The Saturation Number of Induced Subposets of the Boolean Lattice Michael Ferrara a, Bill Kay b, Lucas Kramer c,1, Ryan R. Martin d, Benjamin Reiniger e, Heather C. Smith f,, Eric Sullivan a a Department
More informationLecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is
MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))
More informationContinuous and Borel Dynamics of Countable Borel Equivalence Relations
Continuous and Borel Dynamics of Countable Borel Equivalence Relations S. Jackson (joint with S. Gao, E. Krohne, and B. Seward) Department of Mathematics University of North Texas June 9, 2015 BLAST 2015,
More information4.2 Chain Conditions
4.2 Chain Conditions Imposing chain conditions on the or on the poset of submodules of a module, poset of ideals of a ring, makes a module or ring more tractable and facilitates the proofs of deep theorems.
More informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More information(a ij ) = = λx k 1 (1)
Aaron Dutle Research Statement My main research interests lie, broadly speaking, in the field of combinatorics and graph theory. Most of my recent and current work falls under two general categories. Graph
More informationStochastic Processes
Stochastic Processes 8.445 MIT, fall 20 Mid Term Exam Solutions October 27, 20 Your Name: Alberto De Sole Exercise Max Grade Grade 5 5 2 5 5 3 5 5 4 5 5 5 5 5 6 5 5 Total 30 30 Problem :. True / False
More informationCounterexamples to Indexing System Conjectures
to Indexing System Conjectures January 5, 2016 Contents 1 Introduction 1 2 N Operads 1 2.1 Barratt-Eccles operad........................................ 3 2.2 Computing Stabilizers........................................
More informationNEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS
NEW PERSPECTIVES ON INTERVAL ORDERS AND INTERVAL GRAPHS WILLIAM T. TROTTER Abstract. Interval orders and interval graphs are particularly natural examples of two widely studied classes of discrete structures:
More informationMarkov Chains, Stochastic Processes, and Matrix Decompositions
Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral
More informationInformation Theory and Statistics Lecture 3: Stationary ergodic processes
Information Theory and Statistics Lecture 3: Stationary ergodic processes Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Measurable space Definition (measurable space) Measurable space
More informationConditions for the Equivalence of Largeness and Positive vb 1
Conditions for the Equivalence of Largeness and Positive vb 1 Sam Ballas November 27, 2009 Outline 3-Manifold Conjectures Hyperbolic Orbifolds Theorems on Largeness Main Theorem Applications Virtually
More informationFrom local to global conjugacy in relatively hyperbolic groups
From local to global conjugacy in relatively hyperbolic groups Oleg Bogopolski Webinar GT NY, 5.05.2016 Relative presentations Let G be a group, P = {P λ } λ Λ a collection of subgroups of G, X a subset
More informationDo not open this exam until you are told to begin. You will have 75 minutes for the exam.
Math 2603 Midterm 1 Spring 2018 Your Name Student ID # Section Do not open this exam until you are told to begin. You will have 75 minutes for the exam. Check that you have a complete exam. There are 5
More informationTHE ABSOLUTE MORDELL-LANG CONJECTURE IN POSITIVE CHARACTERISTIC. 1. Introduction
THE ABSOLUTE MORDELL-LANG CONJECTURE IN POSITIVE CHARACTERISTIC THOMAS SCANLON Abstract. We describe intersections of finitely generated subgroups of semi-abelian varieties with subvarieties in characteristic
More informationTrees, Tanglegrams, and Tangled Chains
Trees, Tanglegrams, and Tangled Chains Sara Billey University of Washington Based on joint work with: Matjaž Konvalinka and Frederick (Erick) Matsen IV arxiv:1507.04976 LSU Math Student Colloquium, February
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationCMPSCI 240: Reasoning Under Uncertainty
CMPSCI 240: Reasoning Under Uncertainty Lecture 24 Prof. Hanna Wallach wallach@cs.umass.edu April 24, 2012 Reminders Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/ Eighth
More informationTopological Simplification in 3-Dimensions
Topological Simplification in 3-Dimensions David Letscher Saint Louis University Computational & Algorithmic Topology Sydney Letscher (SLU) Topological Simplification CATS 2017 1 / 33 Motivation Original
More informationOn the Approximate Solution of POMDP and the Near-Optimality of Finite-State Controllers
On the Approximate Solution of POMDP and the Near-Optimality of Finite-State Controllers Huizhen (Janey) Yu (janey@mit.edu) Dimitri Bertsekas (dimitrib@mit.edu) Lab for Information and Decision Systems,
More informationarxiv: v1 [math.co] 28 Jan 2019
THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationA Brooks-Type Theorem for the Bandwidth of Interval Graphs
A Brooks-Type Theorem for the Bandwidth of Interval Graphs Mitchel T. Keller a, Stephen J. Young b a School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 3033-0160 U.S.A. b School of
More informationDiscrete solid-on-solid models
Discrete solid-on-solid models University of Alberta 2018 COSy, University of Manitoba - June 7 Discrete processes, stochastic PDEs, deterministic PDEs Table: Deterministic PDEs Heat-diffusion equation
More informationWeak convergence. Amsterdam, 13 November Leiden University. Limit theorems. Shota Gugushvili. Generalities. Criteria
Weak Leiden University Amsterdam, 13 November 2013 Outline 1 2 3 4 5 6 7 Definition Definition Let µ, µ 1, µ 2,... be probability measures on (R, B). It is said that µ n converges weakly to µ, and we then
More informationAlgebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists.
Group Theory a Let G be a set and be a binary operation on G. (G, ) is called a group if it satisfies the following. 1. For all a, b G, a b G (closure). 2. For all a, b, c G, a (b c) = (a b) c (associativity).
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationMEI Extra Pure: Groups
MEI Extra Pure: Groups Claire Baldwin FMSP Central Coordinator claire.baldwin@mei.org.uk True or False activity Sort the cards into two piles by determining whether the statement on each card is true or
More informationSTOCHASTIC PROCESSES Basic notions
J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving
More informationPoint-Map Probabilities of a Point Process
Point-Map Probabilities of a Point Process F. Baccelli, UT AUSTIN Joint work with M.O. Haji-Mirsadeghi TexAMP, Austin, November 23, 24 Structure of the talk Point processes Palm probabilities Mecke s invariant
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 1
MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter
More informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationLecture 10: Limit groups
Lecture 10: Limit groups Olga Kharlampovich November 4 1 / 16 Groups universally equivalent to F Unification Theorem 1 Let G be a finitely generated group and F G. Then the following conditions are equivalent:
More informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationTwo problems in combinatorial number theory
Two problems in combinatorial number theory Carl Pomerance, Dartmouth College Debrecen, Hungary October, 2010 Our story begins with: Abram S. Besicovitch 1 Besicovitch showed in 1934 that there are primitive
More informationDefinable subsets in a free group
Definable subsets in a free group Olga Kharlampovich, Alexei Miasnikov December 2011, Wien 1 / 26 Abstract We give a description of definable subsets in a free non-abelian group F that follows from our
More informationProblem 4 (Wed Jan 29) Let G be a finite abelian group. Prove that the following are equivalent
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Problem 1 (Fri Jan 24) (a) Find an integer x such that x = 6 mod 10 and x = 15 mod 21 and 0 x 210. (b) Find the smallest positive integer
More informationIntegrals of groups. Peter J. Cameron University of St Andrews. Group actions and transitive graphs Shenzhen, October 2018
Integrals of groups Peter J. Cameron University of St Andrews Group actions and transitive graphs Shenzhen, October 2018 Happy Birthday, Cheryl! Cheryl Praeger and I were both born in Toowoomba, an inland
More informationGS-2013 (Mathematics) TATA INSTITUTE OF FUNDAMENTAL RESEARCH. Written Test in MATHEMATICS December 9, 2012 Duration : Two hours (2 hours)
MTH GS-2013 (Mathematics) TATA INSTITUTE OF FUNDAMENTAL RESEARCH WrittenTestinMATHEMATICSDecember9,2012 Duration:Twohours(2hours) Name: Ref.Code: Pleasereadallinstructionscarefullybeforeyouattemptthequestions.
More informationBalanced subgroups of the multiplicative group
Balanced subgroups of the multiplicative group Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with D. Ulmer To motivate the topic, let s begin with elliptic curves. If
More informationHAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS.
HAMILTONICITY IN CAYLEY GRAPHS AND DIGRAPHS OF FINITE ABELIAN GROUPS. MARY STELOW Abstract. Cayley graphs and digraphs are introduced, and their importance and utility in group theory is formally shown.
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationFirst In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018
First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.
More informationNew Constructions of Difference Matrices
New Constructions of Difference Matrices Department of Mathematics, Simon Fraser University Joint work with Koen van Greevenbroek Outline Difference matrices Basic results, motivation, history Construction
More informationPeriodic decomposition of measurable integer valued functions
Periodic decomposition of measurable integer valued functions Tamás Keleti April 4, 2007 Abstract We study those functions that can be written as a sum of (almost everywhere) integer valued periodic measurable
More informationJumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese
Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October
More informationLecture Notes 3 Convergence (Chapter 5)
Lecture Notes 3 Convergence (Chapter 5) 1 Convergence of Random Variables Let X 1, X 2,... be a sequence of random variables and let X be another random variable. Let F n denote the cdf of X n and let
More informationAn exponential separation between quantum and classical one-way communication complexity
An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationTransitive groups, derangements and related problems
Transitive groups, derangements and related problems Tim Burness University of Bristol Algebraic Combinatorics and Group Actions Herstmonceux Castle July 11th 2016 Introduction Let G be a group acting
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationUCSD ECE269 Handout #18 Prof. Young-Han Kim Monday, March 19, Final Examination (Total: 130 points)
UCSD ECE269 Handout #8 Prof Young-Han Kim Monday, March 9, 208 Final Examination (Total: 30 points) There are 5 problems, each with multiple parts Your answer should be as clear and succinct as possible
More informationFrames of exponentials on small sets
Frames of exponentials on small sets J.-P. Gabardo McMaster University Department of Mathematics and Statistics gabardo@mcmaster.ca Joint work with Chun-Kit Lai (San Francisco State Univ.) Workshop on
More informationElliptic Curves and Mordell s Theorem
Elliptic Curves and Mordell s Theorem Aurash Vatan, Andrew Yao MIT PRIMES December 16, 2017 Diophantine Equations Definition (Diophantine Equations) Diophantine Equations are polynomials of two or more
More informationIsomorphic Cayley Graphs on Nonisomorphic Groups
Isomorphic Cayley raphs on Nonisomorphic roups Joy Morris Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC. V5A 1S6. CANADA. morris@cs.sfu.ca January 12, 2004 Abstract: The
More informationAlgorithms for Permutation groups
Algorithms for Permutation groups Alice Niemeyer UWA, RWTH Aachen Alice Niemeyer (UWA, RWTH Aachen) Perm Groups Sommerschule 2011 1 / 36 Permutation Groups Permutation Groups The Symmetric Group Let Ω
More informationDegree of commutativity of infinite groups
Degree of commutativity of infinite groups... or how I learnt about rational growth and ends of groups Motiejus Valiunas University of Southampton Groups St Andrews 2017 11th August 2017 The concept of
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationMath Homework 5 Solutions
Math 45 - Homework 5 Solutions. Exercise.3., textbook. The stochastic matrix for the gambler problem has the following form, where the states are ordered as (,, 4, 6, 8, ): P = The corresponding diagram
More informationPCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)
PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION) EMMANUEL BREUILLARD 1. Lecture 1, Spectral gaps for infinite groups and non-amenability The final aim of
More informationOn the Fully Commutative Elements of Coxeter Groups
Journal of Algebraic Combinatorics 5 (1996), 353-385 1996 Kluwer Academic Publishers. Manufactured in The Netherlands. On the Fully Commutative Elements of Coxeter Groups JOHN R. STEMBRIDGB* Department
More informationQuotients of vertex-transitive graphs
Chapter 5 Quotients of vertex-transitive graphs This chapter will study some operations on vertex-transitive graphs. 5.1 Quotient graphs Let Γ = (V,E) be a digraph. For a partition B of V,thequotient Γ
More informationBruhat-Tits Buildings
Katerina Hristova University of Warwick October 2016 The set up Let (W, S) be a Coxeter system, where S is a set indexed by I = {1,.., n}. So W is of the form W = s 1,..., s n (s i ) 2 = 1, (s i s j )
More informationReceived: 1 September 2018; Accepted: 10 October 2018; Published: 12 October 2018
entropy Article Entropy Inequalities for Lattices Peter Harremoës Copenhagen Business College, Nørre Voldgade 34, 1358 Copenhagen K, Denmark; harremoes@ieee.org; Tel.: +45-39-56-41-71 Current address:
More informationDefinable and negligible subsets of free groups
Definable and negligible subsets of free groups (in honor of Karen Vogtmann s 60th birthday) joint with Mladen Bestvina Luminy, June 23, 2010 OUTLINE 1 Extension Problems 2 Definable Subsets of F 3 Negligible
More informationCohomology of Coxeter groups and buildings
(work with Jan Dymara, Tadeusz Januskiewicz and Boris Okun) MSRI August 27, 2007 The theory of abstract reflection groups or Coxeter groups was developed by J. Tits around 1960. This is a much larger
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationACTING FREELY GABRIEL GASTER
ACTING FREELY GABRIEL GASTER 1. Preface This article is intended to present a combinatorial proof of Schreier s Theorem, that subgroups of free groups are free. While a one line proof exists using the
More informationREU Problems. Instructor: László Babai Last updated: Monday, July 11 (Problems added)
REU 2011 - Problems Instructor: László Babai e-mail: laci@cs.uchicago.edu Last updated: Monday, July 11 (Problems 48-53 added) 1. (Balancing numbers) Suppose we have 13 real numbers with the following
More informationAlgebra Exercises in group theory
Algebra 3 2010 Exercises in group theory February 2010 Exercise 1*: Discuss the Exercises in the sections 1.1-1.3 in Chapter I of the notes. Exercise 2: Show that an infinite group G has to contain a non-trivial
More information