scholarly journals Randomness in classes of matroids

2021 ◽  
Author(s):  
◽  
William Critchlow
Keyword(s):  
Lower Bound ◽  
Bipartite Graphs ◽  
Random Model ◽  
Asymptotic Results ◽  
Mathematical Objects ◽  
Set Systems ◽  
Random Models ◽  
Special Subset ◽  
One To One ◽  
Almost All

<p>This thesis is inspired by the observation that we have no good random model for matroids. That stands in contrast to graphs, which admit a number of elegant random models. As a result we have relatively little understanding of the properties of a "typical" matroid. Acknowledging the difficulty of the general case, we attempt to gain a grasp on randomness in some chosen classes of matroids.  Firstly, we consider sparse paving matroids, which are conjectured to dominate the class of matroids (that is to say, asymptotically almost all matroids would be sparse paving). If this conjecture were true, then many results on properties of the random sparse paving matroid would also hold for the random matroid. Sparse paving matroids have limited richness of structure, making counting arguments in particular more feasible than for general matroids. This enables us to prove a number of asymptotic results, particularly with regards to minors.  Secondly, we look at Graham-Sloane matroids, a special subset of sparse paving matroids with even more limited structure - in fact Graham-Sloane matroids on a labelled groundset can be randomly generated by a process as simple as independently including certain bases with probability 0.5. Notably, counting Graham-Sloane matroids has provided the best known lower bound on the total number of matroids, to log-log level. Despite the vast size of the class we are able to prove severe restrictions on what minors of Graham-Sloane matroids can look like.  Finally we consider transversal matroids, which arise naturally in the context of other mathematical objects - in particular partial transversals of set systems and partial matchings in bipartite graphs. Although transversal matroids are not in one-to-one correspondence with bipartite graphs, we shall link the two closely enough to gain some useful results through exploiting the properties of random bipartite graphs. Returning to the theme of matroid minors, we prove that the class of transversal matroids of given rank is defined by finitely many excluded series-minors. Lastly we consider some other topics, including the axiomatisability of transversal matroids and related classes.</p>

scholarly journals Randomness in classes of matroids

2021 ◽  
Author(s):  
◽  
William Critchlow
Keyword(s):  
Lower Bound ◽  
Bipartite Graphs ◽  
Random Model ◽  
Asymptotic Results ◽  
Mathematical Objects ◽  
Set Systems ◽  
Random Models ◽  
Special Subset ◽  
One To One ◽  
Almost All

<p>This thesis is inspired by the observation that we have no good random model for matroids. That stands in contrast to graphs, which admit a number of elegant random models. As a result we have relatively little understanding of the properties of a "typical" matroid. Acknowledging the difficulty of the general case, we attempt to gain a grasp on randomness in some chosen classes of matroids.  Firstly, we consider sparse paving matroids, which are conjectured to dominate the class of matroids (that is to say, asymptotically almost all matroids would be sparse paving). If this conjecture were true, then many results on properties of the random sparse paving matroid would also hold for the random matroid. Sparse paving matroids have limited richness of structure, making counting arguments in particular more feasible than for general matroids. This enables us to prove a number of asymptotic results, particularly with regards to minors.  Secondly, we look at Graham-Sloane matroids, a special subset of sparse paving matroids with even more limited structure - in fact Graham-Sloane matroids on a labelled groundset can be randomly generated by a process as simple as independently including certain bases with probability 0.5. Notably, counting Graham-Sloane matroids has provided the best known lower bound on the total number of matroids, to log-log level. Despite the vast size of the class we are able to prove severe restrictions on what minors of Graham-Sloane matroids can look like.  Finally we consider transversal matroids, which arise naturally in the context of other mathematical objects - in particular partial transversals of set systems and partial matchings in bipartite graphs. Although transversal matroids are not in one-to-one correspondence with bipartite graphs, we shall link the two closely enough to gain some useful results through exploiting the properties of random bipartite graphs. Returning to the theme of matroid minors, we prove that the class of transversal matroids of given rank is defined by finitely many excluded series-minors. Lastly we consider some other topics, including the axiomatisability of transversal matroids and related classes.</p>

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

Lower bound on the profile of degree pairs in cross-intersecting set systems

COMBINATORICA ◽  
2007 ◽  
Vol 27 (3) ◽  
pp. 399-405
Author(s):  
Zsuzsanna Szaniszló ◽  
Zsolt Tuza
Keyword(s):  
Lower Bound ◽  
Set Systems

scholarly journals Lower Bounds for the Size of Random Maximal $H$-Free Graphs

10.37236/93 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Guy Wolfovitz
Keyword(s):  
Lower Bound ◽  
Random Process ◽  
Lower Bounds ◽  
Random Permutation ◽  
Bipartite Graphs ◽  
Expected Number ◽  
Free Graph ◽  
Vertex Graph

We consider the next random process for generating a maximal $H$-free graph: Given a fixed graph $H$ and an integer $n$, start by taking a uniformly random permutation of the edges of the complete $n$-vertex graph $K_n$. Then, traverse the edges of $K_n$ according to the order imposed by the permutation and add each traversed edge to an (initially empty) evolving $n$-vertex graph - unless its addition creates a copy of $H$. The result of this process is a maximal $H$-free graph ${\Bbb M}_n(H)$. Our main result is a new lower bound on the expected number of edges in ${\Bbb M}_n(H)$, for $H$ that is regular, strictly $2$-balanced. As a corollary, we obtain new lower bounds for Turán numbers of complete, balanced bipartite graphs. Namely, for fixed $r \ge 5$, we show that ex$(n, K_{r,r}) = \Omega(n^{2-2/(r+1)}(\ln\ln n)^{1/(r^2-1)})$. This improves an old lower bound of Erdős and Spencer. Our result relies on giving a non-trivial lower bound on the probability that a given edge is included in ${\Bbb M}_n(H)$, conditioned on the event that the edge is traversed relatively (but not trivially) early during the process.

scholarly journals On the endomorphism near-ring of a free group

1980 ◽  
Vol 23 (1) ◽  
pp. 103-121 ◽  
Author(s):  
R. Warwick Zeamer
Keyword(s):  
Wreath Product ◽  
Free Group ◽  
The Other ◽  
Finite Support ◽  
Finite Product ◽  
Prime Factorization ◽  
Infinite Rank ◽  
One To One ◽  
Almost All ◽  
Countably Infinite

Suppose F is an additively written free group of countably infinite rank with basis T and let E = End(F). If we add endomorphisms pointwise on T and multiply them by map composition, E becomes a near-ring. In her paper “On Varieties of Groups and their Associated Near Rings” Hanna Neumann studied the sub-near-ring of E consisting of the endomorphisms of F of finite support, that is, those endomorphisms taking almost all of the elements of T to zero. She called this near-ring Φω. Now it happens that the ideals of Φω are in one to one correspondence with varieties of groups. Moreover this correspondence is a monoid isomorphism where the ideals of φω are multiplied pointwise. The aim of Neumann's paper was to use this isomorphism to show that any variety can be written uniquely as a finite product of primes, and it was in this near-ring theoretic context that this problem was first raised. She succeeded in showing that the left cancellation law holds for varieties (namely, U(V) = U′(V) implies U = U′) and that any variety can be written as a finite product of primes. The other cancellation law proved intractable. Later, unique prime factorization of varieties was proved by Neumann, Neumann and Neumann, in (7). A concise proof using these same wreath product techniques was also given in H. Neumann's book (6). These proofs, however, bear no relation to the original near-ring theoretic statement of the problem.

scholarly journals Primes in Short Segments of Arithmetic Progressions

1998 ◽  
Vol 50 (3) ◽  
pp. 563-580 ◽  
Author(s):  
D. A. Goldston ◽  
C. Y. Yildirim
Keyword(s):  
Asymptotic Formula ◽  
Lower Bounds ◽  
Arithmetic Progression ◽  
Riemann Hypothesis ◽  
Total Variance ◽  
Correct Order ◽  
Asymptotic Results ◽  
Extended Range ◽  
Order Of Magnitude ◽  
Almost All

AbstractConsider the variance for the number of primes that are both in the interval [y,y + h] for y ∈ [x,2x] and in an arithmetic progression of modulus q. We study the total variance obtained by adding these variances over all the reduced residue classes modulo q. Assuming a strong form of the twin prime conjecture and the Riemann Hypothesis one can obtain an asymptotic formula for the total variance in the range when 1 ≤ h/q ≤ x1/2-∈ , for any ∈ > 0. We show that one can still obtain some weaker asymptotic results assuming the Generalized Riemann Hypothesis (GRH) in place of the twin prime conjecture. In their simplest form, our results are that on GRH the same asymptotic formula obtained with the twin prime conjecture is true for “almost all” q in the range 1 ≤ h/q ≤ x1/4-∈, that on averaging over q one obtains an asymptotic formula in the extended range 1 ≤ h/q ≤ x1/2-∈, and that there are lower bounds with the correct order of magnitude for all q in the range 1 ≤ h/q ≤ x1/3-∈.

scholarly journals Biclique edge-choosability in some classes of graphs∗

2017 ◽  
Author(s):  
Gabriel A. G. Sobral ◽  
Marina Groshaus ◽  
André L. P. Guedes
Keyword(s):  
Lower Bound ◽  
Edge Coloring ◽  
Bipartite Graphs ◽  
Polynomial Algorithms ◽  
Odd Cycles ◽  
Chordal Bipartite Graphs

In this paper we study the problem of coloring the edges of a graph for any k-list assignment such that there is no maximal monochromatic biclique, in other words, the k-biclique edge-choosability problem. We prove that the K3free graphs that are not odd cycles are 2-star edge-choosable, chordal bipartite graphs are 2-biclique edge-choosable and we present a lower bound for the biclique choice index of power of cycles and power of paths. We also provide polynomial algorithms to compute a 2-biclique (star) edge-coloring for K3-free and chordal bipartite graphs for any given 2-list assignment to edges.

scholarly journals Where Natural Protein Sequences Stand out From Randomness

2019 ◽  
Author(s):  
Laura Weidmann ◽  
Tjeerd Dijkstra ◽  
Oliver Kohlbacher ◽  
Andrei Lupas
Keyword(s):  
Natural Selection ◽  
Protein Structure ◽  
Sequence Space ◽  
Protein Sequences ◽  
Random Model ◽  
Biological Sequences ◽  
Natural Protein ◽  
Distance Distributions ◽  
Random Models ◽  
Residue Composition

AbstractBiological sequences are the product of natural selection, raising the expectation that they differ substantially from random sequences. We test this expectation by analyzing all fragments of a given length derived from either a natural dataset or different random models. For this, we compile all distances in sequence space between fragments within each dataset and compare the resulting distance distributions between sets. Even for 100mers, 95.4% of all distances between natural fragments are in accordance with those of a random model incorporating the natural residue composition. Hence, natural sequences are distributed almost randomly in global sequence space. When further accounting for the specific residue composition of domain-sized fragments, 99.2% of all distances between natural fragments can be modeled. Local residue composition, which might reflect biophysical constraints on protein structure, is thus the predominant feature characterizing distances between natural sequences globally, whereas homologous effects are only barely detectable.

scholarly journals Colorful Subhypergraphs in Kneser Hypergraphs

10.37236/3573 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Frédéric Meunier
Keyword(s):  
Lower Bound ◽  
Chromatic Number ◽  
Bipartite Graphs ◽  
Uniform Hypergraph ◽  
Proper Coloring ◽  
Kneser Graph ◽  
Complete Bipartite Graphs ◽  
Definition Of ◽  
Ky Fan

Using a $\mathbb{Z}_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can be the local chromatic number of a uniform hypergraph).

Sign in / Sign up

Export Citation Format

Share Document