forbidden configuration
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)

2021 ◽  
Vol 8 (30) ◽  
pp. 948-970
Author(s):  
Samuel Braunfeld ◽  
Michael Laskowski

We give several characterizations of when a complete first-order theory T T is monadically NIP, i.e. when expansions of T T by arbitrary unary predicates do not have the independence property. The central characterization is a condition on finite satisfiability of types. Other characterizations include decompositions of models, the behavior of indiscernibles, and a forbidden configuration. As an application, we prove non-structure results for hereditary classes of finite substructures of non-monadically NIP models that eliminate quantifiers.


2014 ◽  
Vol 07 (03) ◽  
pp. 1450044 ◽  
Author(s):  
R. S. Shewale ◽  
V. S. Kharat

In this paper, we have introduced a new concept of a modular pair in terms of maximal elements of lower cone (L) and minimal elements of upper cone (U) in posets. The relation between our definition and the existing definitions of modular pairs in posets has been studied for different classes of posets. We succeeded in characterizing a modular pair by means of forbidden configuration in general posets. We have obtained several characterizations of modular pairs in atomistic and semi-orthogonal posets. We have also introduced ∇-relation in posets.


10.37236/2379 ◽  
2013 ◽  
Vol 1000 ◽  
Author(s):  
Richard Anstee

Let $F$ be a $k\times \ell$ (0,1)-matrix. We say a (0,1)-matrix $A$ has $F$ as a configuration if there is a submatrix of $A$ which is a row and column permutation of $F$. In the language of sets, a configuration is a trace and in the language of hypergraphs a configuration is a subhypergraph.Let $F$ be a given $k\times \ell$ (0,1)-matrix. We define a matrix to be simple if it is a (0,1)-matrix with no repeated columns. The matrix $F$ need not be simple. We define $\hbox{forb}(m,F)$ as the maximum number of columns of any simple $m$-rowed matrix $A$ which do not contain $F$ as a configuration. Thus if $A$ is an $m\times n$ simple matrix which has no submatrix which is a row and column permutation of $F$ then $n\le\hbox{forb}(m,F)$. Or alternatively if $A$ is an $m\times (\hbox{forb}(m,F)+1)$ simple matrix then $A$ has a submatrix which is a row and column permutation of $F$. We call $F$ a forbidden configuration. The fundamental result is due to Sauer, Perles and Shelah, Vapnik and Chervonenkis. For $K_k$ denoting the $k\times 2^k$ submatrix of all (0,1)-columns on $k$ rows, then $\hbox{forb}(m,K_k)=\binom{m}{k-1}+\binom{m}{k-2}+\cdots \binom{m}{0}$. We seek asymptotic results for $\hbox{forb}(m,F)$ for a fixed $F$ and as $m$ tends to infinity . A conjecture of Anstee and Sali predicts the asymptotically best constructions from which to derive the asymptotics of $\hbox{forb}(m,F)$. The conjecture has helped guide the research and has been verified for $k\times \ell$ $F$ with $k=1,2,3$ and for simple $F$ with $k=4$ as well as other cases including $\ell=1,2$. We also seek exact values for $\hbox{forb}(m,F)$. 


2012 ◽  
Vol 312 (17) ◽  
pp. 2720-2729 ◽  
Author(s):  
R.P. Anstee ◽  
M. Raggi ◽  
A. Sali

2011 ◽  
Vol 48 (1) ◽  
pp. 1-22
Author(s):  
Richard Anstee ◽  
Farzin Barekat ◽  
Attila Sali

The present paper continues the work begun by Anstee, Ferguson, Griggs, Kamoosi and Sali on small forbidden configurations. We define a matrix to besimpleif it is a (0, 1)-matrix with no repeated columns. LetFbe ak× (0, 1)-matrix (the forbidden configuration). AssumeAis anm×nsimple matrix which has no submatrix which is a row and column permutation ofF. We define forb (m, F) as the largestn, which would depend onmandF, so that such anAexists.DefineFabcdas the (a+b+c+d) × 2 matrix consisting ofarows of [11],brows of [10],crows of [01] anddrows of [00]. With the exception ofF2110, we compute forb (m; Fabcd) for all 4 × 2Fabcd. A number of cases follow easily from previous results and general observations. A number follow by clever inductions based on a single column such as forb (m; F1111) = 4m− 4 and forb (m; F1210) = forb (m; F1201) = forb (m; F0310) = (2m)+m+ 2 (proofs are different). A different idea proves forb (m; F0220) = (2m) + 2m− 1 with the forbidden configuration being related to a result of Kleitman. Our results suggest that determining forb (m; F2110) is heavily related to designs and we offer some constructions of matrices avoidingF2110using existing designs.


10.37236/997 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
R. P. Anstee ◽  
N. Kamoosi

The present paper continues the work begun by Anstee, Ferguson, Griggs and Sali on small forbidden configurations. We define a matrix to be simple if it is a (0,1)-matrix with no repeated columns. Let $F$ be a $k\times l$ (0,1)-matrix (the forbidden configuration). Assume $A$ is an $m\times n$ simple matrix which has no submatrix which is a row and column permutation of $F$. We define ${\hbox{forb}}(m,F)$ as the largest $n$, which would depend on $m$ and $F$, so that such an $A$ exists. 'Small' refers to the size of $k$ and in this paper $k=2$. For $p\le q$, we set $F_{pq}$ to be the $2\times (p+q)$ matrix with $p$ $\bigl[{1\atop0}\bigr]$'s and $q$ $\bigl[{0\atop1}\bigr]$'s. We give new exact values: ${\hbox{forb}}(m,F_{0,4})=\lfloor {5m\over2}\rfloor +2$, ${\hbox{forb}}(m,F_{1,4})=\lfloor {11m\over4}\rfloor +1$, ${\hbox{forb}}(m,F_{1,5})=\lfloor {15m\over4}\rfloor +1$, ${\hbox{forb}}(m,F_{2,4})=\lfloor {10m\over3}-{4\over3}\rfloor$ and ${\hbox{forb}}(m,F_{2,5})=4m$ (For ${\hbox{forb}}(m,F_{1,4})$, ${\hbox{forb}}(m,F_{1,5})$ we obtain equality only for certain classes modulo 4). In addition we provide a surprising construction which shows ${\hbox{forb}}(m,F_{pq})\ge \bigl({p+q\over2}+O(1)\bigr)m$.


2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Richard Anstee ◽  
Balin Fleming ◽  
Zoltán Füredi ◽  
Attila Sali

International audience The present paper connects sharpenings of Sauer's bound on forbidden configurations with color critical hypergraphs. We define a matrix to be \emphsimple if it is a $(0,1)-matrix$ with no repeated columns. Let $F$ be $a k× l (0,1)-matrix$ (the forbidden configuration). Assume $A$ is an $m× n$ simple matrix which has no submatrix which is a row and column permutation of $F$. We define $forb(m,F)$ as the best possible upper bound on n, for such a matrix $A$, which depends on m and $F$. It is known that $forb(m,F)=O(m^k)$ for any $F$, and Sauer's bond states that $forb(m,F)=O(m^k-1)$ fore simple $F$. We give sufficient condition for non-simple $F$ to have the same bound using linear algebra methods to prove a generalization of a result of Lovász on color critical hypergraphs.


10.37236/1548 ◽  
2000 ◽  
Vol 8 (1) ◽  
Author(s):  
Richard Anstee ◽  
Ron Ferguson ◽  
Attila Sali

The present paper continues the work begun by Anstee, Griggs and Sali on small forbidden configurations. In the notation of (0,1)-matrices, we consider a (0,1)-matrix $F$ (the forbidden configuration), an $m\times n$ (0,1)-matrix $A$ with no repeated columns which has no submatrix which is a row and column permutation of $F$, and seek bounds on $n$ in terms of $m$ and $F$. We give new exact bounds for some $2\times l$ forbidden configurations and some asymptotically exact bounds for some other $2\times l$ forbidden configurations. We frequently employ graph theory and in one case develop a new vertex ordering for directed graphs that generalizes Rédei's Theorem for Tournaments. One can now imagine that exact bounds could be available for all $2\times l$ forbidden configurations. Some progress is reported for $3\times l$ forbidden configurations. These bounds are improvements of the general bounds obtained by Sauer, Perles and Shelah, Vapnik and Chervonenkis.


Sign in / Sign up

Export Citation Format

Share Document