scholarly journals Pairwise Intersections and Forbidden Configurations

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Richard P. Anstee ◽  
Peter Keevash
Keyword(s):  
Complete Intersection ◽  
Maximum Size ◽  
Strong Stability ◽  
Independent Interest ◽  
Intersection Theorem ◽  
International Audience ◽  
Forbidden Configurations ◽  
Element Set

International audience Let $f_m(a,b,c,d)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $m$-element set for which there is no pair of subsets $A,B \in \mathcal{F}$ with $|A \cap B| \geq a$, $|\bar{A} \cap B| \geq b$, $|A \cap \bar{B}| \geq c$, and $|\bar{A} \cap \bar{B}| \geq d$. By symmetry we can assume $a \geq d$ and $b \geq c$. We show that $f_m(a,b,c,d)$ is $\Theta (m^{a+b-1})$ if either $b > c$ or $a,b \geq 1$. We also show that $f_m(0,b,b,0)$ is $\Theta (m^b)$ and $f_m(a,0,0,d)$ is $\Theta (m^a)$. This can be viewed as a result concerning forbidden configurations and is further evidence for a conjecture of Anstee and Sali. Our key tool is a strong stability version of the Complete Intersection Theorem of Ahlswede and Khachatrian, which is of independent interest.

Complete Intersection Flat Dimension and the Intersection Theorem

2012 ◽  
Vol 19 (spec01) ◽  
pp. 1161-1166
Author(s):  
Parviz Sahandi ◽  
Tirdad Sharif ◽  
Siamak Yassemi
Keyword(s):  
Local Ring ◽  
Complete Intersection ◽  
Intersection Theorem ◽  
Finitely Generated ◽  
Finitely Generated Module ◽  
Gorenstein Dimension ◽  
Flat Dimension ◽  
Gorenstein Flat ◽  
Similar Extension

Any finitely generated module M over a local ring R is endowed with a complete intersection dimension CI-dim RM and a Gorenstein dimension G-dim RM. The Gorenstein dimension can be extended to all modules over the ring R. This paper presents a similar extension for the complete intersection dimension, and mentions the relation between this dimension and the Gorenstein flat dimension. In addition, we show that in the intersection theorem, the flat dimension can be replaced by the complete intersection flat dimension.

scholarly journals Defect Effect of Bi-infinite Words in the Two-element Case

2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
Ján Maňuch
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Finite Alphabet ◽  
Infinite Words ◽  
Infinite Word ◽  
The Family ◽  
International Audience ◽  
Necessary And Sufficient ◽  
Primitive Roots ◽  
Element Set

International audience Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a defect theorem for bi-infinite words stated in \emphKMP. Moreover, we prove that there is at most one bi-infinite word possessing two different X-factorizations and give a necessary and sufficient conditions on X for the existence of such a word. Finally, we prove that the family of sets X for which such a word exists is parameterizable.

scholarly journals Cumulants of Jack symmetric functions and b-conjecture (extended abstract)

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Maciej Dolega ◽  
Valentin Féray
Keyword(s):  
Nonnegative Integer ◽  
Symmetric Functions ◽  
Rational Functions ◽  
Independent Interest ◽  
Jack Polynomials ◽  
Factorization Property ◽  
Integer Coefficients ◽  
Continuous Deformation ◽  
Generating Series ◽  
International Audience

International audience Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series ψ(x, y, z; t, 1 + β) that might be interpreted as a continuous deformation of the rooted hypermap generating series. They made the following conjecture: coefficients of ψ(x, y, z; t, 1+β) are polynomials in β with nonnegative integer coefficients. We prove partially this conjecture, nowadays called b-conjecture, by showing that coefficients of ψ(x, y, z; t, 1 + β) are polynomials in β with rational coefficients. Until now, it was only known that they are rational functions of β. A key step of the proof is a strong factorization property of Jack polynomials when α → 0 that may be of independent interest.

scholarly journals A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon

2015 ◽  
Vol Vol. 17 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Sergio Cabello ◽  
Maria Saumell
Keyword(s):  
Hamiltonian Cycle ◽  
Randomized Algorithm ◽  
Maximum Clique ◽  
Simple Polygon ◽  
Maximum Size ◽  
Visibility Graph ◽  
Probability Of Error ◽  
Discrete Algorithms ◽  
International Audience ◽  
Previous Algorithm

Discrete Algorithms International audience We present a randomized algorithm to compute a clique of maximum size in the visibility graph G of the vertices of a simple polygon P. The input of the problem consists of the visibility graph G, a Hamiltonian cycle describing the boundary of P, and a parameter δ∈(0,1) controlling the probability of error of the algorithm. The algorithm does not require the coordinates of the vertices of P. With probability at least 1-δ the algorithm runs in O( |E(G)|2 / ω(G) log(1/δ)) time and returns a maximum clique, where ω(G) is the number of vertices in a maximum clique in G. A deterministic variant of the algorithm takes O(|E(G)|2) time and always outputs a maximum size clique. This compares well to the best previous algorithm by Ghosh et al. (2007) for the problem, which is deterministic and runs in O(|V(G)|2 |E(G)|) time.

scholarly journals Color critical hypergraphs and forbidden configurations

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Richard Anstee ◽  
Balin Fleming ◽  
Zoltán Füredi ◽  
Attila Sali
Keyword(s):  
Linear Algebra ◽  
Upper Bound ◽  
Sufficient Condition ◽  
Column Permutation ◽  
International Audience ◽  
Simple Matrix ◽  
Forbidden Configuration ◽  
Forbidden Configurations

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.

scholarly journals A characterization for all interval doubling schemes of the lattice of permutations

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Nathalie Caspard
Keyword(s):  
Direct Corollary ◽  
International Audience ◽  
Constructive Property ◽  
Element Set

International audience The lattice \textbfS_n of all permutations on a n-element set has been shown to be \emphbounded [CAS], which is a strong constructive property characterized by the fact that \textbfS_n admits what we call an \emph interval doubling scheme. In this paper we characterize all interval doubling schemes of the lattice \textbfS_n, a result that gives a nice precision on the bounded nature of the lattice of permutations. This theorem is a direct corollary of two strong properties that are also given with their proofs.

scholarly journals The Complete Intersection Theorem for Systems of Finite Sets

1997 ◽  
Vol 18 (2) ◽  
pp. 125-136 ◽  
Author(s):  
Rudolf Ahlswede ◽  
Levon H. Khachatrian
Keyword(s):  
Complete Intersection ◽  
Intersection Theorem ◽  
Finite Sets

scholarly journals On bijections between monotone rooted trees and the comb basis

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Fu Liu
Keyword(s):  
Lie Algebra ◽  
Rooted Trees ◽  
Close Connection ◽  
Free Lie Algebra ◽  
Nous Montrons ◽  
Il Y A ◽  
International Audience ◽  
Lie Brackets ◽  
Element Set

International audience Let $A$ be an $n$-element set. Let $\mathscr{L} ie_2(A)$ be the multilinear part of the free Lie algebra on $A$ with a pair of compatible Lie brackets, and $\mathscr{L} ie_2(A, i)$ the subspace of $\mathscr{L} ie_2(A)$ generated by all the monomials in $\mathscr{L} ie_2(A)$ with $i$ brackets of one type. The author and Dotsenko-Khoroshkin show that the dimension of $\mathscr{L} ie_2(A, i)$ is the size of $R_{A,i}$, the set of rooted trees on $A$ with $i$ decreasing edges. There are three families of bases known for $\mathscr{L} ie_2(A, i)$ the comb basis, the Lyndon basis, and the Liu-Lyndon basis. Recently, González D'León and Wachs, in their study of (co)homology of the poset of weighted partitions (which has close connection to $\mathscr{L} ie_2(A, i)$), asked whether there are nice bijections between $R_{A,i}$ and the comb basis or the Lyndon basis. We give a natural definition for " nice bijections " , and conjecture that there is a unique nice bijection between $R_{A,i}$ and the comb basis. We show the conjecture is true for the extreme cases where $i=0$, $n−1$. Soit $A$ un ensemble à $n$ éléments. Soit $\mathscr{L} ie_2(A)$ la partie multilinéaire de l'algèbre de Lie libre sur $A$ avec une paire de crochets de Lie compatibles et $\mathscr{L} ie_2(A, i)$ le sous-espace de$\mathscr{L} ie_2(A)$ généré par tous les monômes en $\mathscr{L} ie_2(A)$ avec $i$ supports d'un même type. L'auteur et Dotsenko-Khoroshkin montrent que la dimension de $\mathscr{L} ie_2(A, i)$ est la taille de la $R_{A,i}$, l'ensemble des arbres enracinés sur $A$ avec $i$ arêtes décroissantes. Il y a trois familles de bases connues pour $\mathscr{L} ie_2(A, i)$ : la base de peigne, la base Lyndon, et la base Liu-Lyndon. Récemment, Gonzalez, D' Léon et Wachs, dans leur étude de (co)-homologie de la poset des partitions pondérés, ont demandé si il y a des bijections jolies entre$R_{A,i}$, et la base de peigne ou la base Lyndon. Nous donnons une définition naturelle de "bijection jolie " , et un conjecture qu'il y a une seule bijection jolie entre $R_{A,i}$, et la base de peigne. Nous montrons que la conjecture est vraie pour les cas extrêmes: $i = 0$, et $n − 1$.

scholarly journals Properties of Random Graphs via Boltzmann Samplers

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Konstantinos Panagiotou ◽  
Andreas Weißl
Keyword(s):  
Random Graphs ◽  
Maximum Degree ◽  
Maximum Size ◽  
Structural Constraints ◽  
Convex Polygons ◽  
Typical Member ◽  
Graph Classes ◽  
International Audience ◽  
Cactus Graphs

International audience This work is devoted to the understanding of properties of random graphs from graph classes with structural constraints. We propose a method that is based on the analysis of the behaviour of Boltzmann sampler algorithms, and may be used to obtain precise estimates for the maximum degree and maximum size of a biconnected block of a "typical'' member of the class in question. We illustrate how our method works on several graph classes, namely dissections and triangulations of convex polygons, embedded trees, and block and cactus graphs.

Sign in / Sign up

Export Citation Format

Share Document