A combinatorial problem; stability and order for models and theories in infinitary languages
From MaRDI portal
Publication:2553434
Cited in
(only showing first 100 items - show all)- Combinatorial lemmas and applications to dynamics
- Combinatorial independence in measurable dynamics
- On the density of sets of vectors
- Uncountable extensions of countable algebraically closed semigroups
- Matrices with forbidden subconfigurations
- General forbidden configuration theorems
- Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
- Forbidden submatrices
- The Banach-Mazur distance to the cube and the Dvoretzky-Rogers factorization
- Bounding one-way differences
- A forbidden configuration theorem of Alon
- Periodic existentially closed nilpotent groups
- Testing conditional independence in supervised learning algorithms
- Constructing strongly equivalent nonisomorphic models for unstable theories
- Type, infratype and the Elton-Pajor theorem
- Trade-offs between communication and space
- Uncountable universal locally finite groups
- Coordinate density of sets of vectors
- A graph-theoretic generalization of the Sauer-Shelah lemma
- Selecting a proportion of characters
- Combinatorics and connectionism
- Density results for uniform families
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Some best possible bounds concerning the traces of finite sets
- On the density of sets of divisors
- On the convexified Sauer-Shelah theorem
- Small forbidden configurations
- An unclassifiable unidimensional theory without OTOP
- Sperner families of bounded VC-dimension
- Guarding galleries where every point sees a large area
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- PAC-learning from general examples
- Ranks and pregeometries in finite diagrams
- A Sauer-Shelah-Perles lemma for sumsets
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
- Approximating a convex body by a polytope using the epsilon-net theorem
- Domination in tournaments
- Forbidden subposet problems for traces of set families
- Traces of antichains
- Forbidden configurations, discrepancy and determinants
- Density and dimension
- Some remarks about embeddings of \(l_1^k\) in finite-dimensional spaces
- General lower bounds on the query complexity within the exact learning model
- On the complexity of approximating the VC dimension.
- Multicoloured extremal problems
- Forbidden configurations: Induction and linear algebra
- dp-rank and forbidden configurations
- Shattering-extremal set systems of small VC-dimension
- On membership comparable sets
- Separation by convex pseudo-circles
- Choosing between incompatible ideals
- On extremal problems concerning the traces of sets
- VC-dimensions of nondeterministic finite automata for words of equal length
- Bounding the trace function of a hypergraph with applications
- Hanf number of the first stability cardinal in AECs
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- VC-saturated set systems
- Shattering and more: Extending the complete object
- Uniform approximation rates and metric entropy of shallow neural networks
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
- On the maximal number of columns of a \(\varDelta \)-modular matrix
- A uniform version of a theorem by Dvir and Moran
- Nondegenerate spheres in four dimensions
- The \(\varepsilon\)-\(t\)-net problem
- What convex geometries tell about shattering-extremal systems
- On partial cubes, well-graded families and their duals with some applications in graphs
- A Sauer-Shelah-Perles lemma for lattices
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Shattered matchings in intersecting hypergraphs
- Sequential complexities and uniform martingale laws of large numbers
- On forbidden submatrices
- Ramsey numbers of Berge-hypergraphs and related structures
- A local Vapnik-Chervonenkis complexity
- Multi-symbol forbidden configurations
- Shattering-extremal set systems from Sperner families
- VC-density for trees
- VC dimension and a union theorem for set systems
- A local variational relation and applications
- Independence in topological and \(C^*\)-dynamics
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension
- Some new maximum VC classes
- Forbidding complete hypergraphs as traces
- Aspects of discrete mathematics and probability in the theory of machine learning
- Projective geometries in dense matroids
- On the density of families of sets
- Disjoint representability of sets and their complements
- Integer cells in convex sets
- The enumerability of P collapses P to NC
- Two results on entropy, chaos and independence in symbolic dynamics
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Time and space complexity of deterministic and nondeterministic decision trees
- An elementary proof of a lower bound for the inverse of the star discrepancy
- Vapnik-Chervonenkis density in some theories without the independence property. I
- Erdős and set theory
- Bounding embeddings of VC classes into maximum classes
- Labeled compression schemes for extremal classes
- Infinitary stability theory
- Family independence for topological and measurable dynamics
This page was built for publication: A combinatorial problem; stability and order for models and theories in infinitary languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553434)
