English
Related papers

Related papers: Dominating numbers for countable structures

200 papers

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

This lecture consists of two sections. In section 1 we consider the simplest version of a q-deformed Heisenberg algebra as an example of a noncommutative structure. We first derive a calculus entirely based on the algebra and then formulate…

Mathematical Physics · Physics 2007-05-23 J. Wess

Let $X$ be an affine algebraic variety with a transitive action of the algebraic automorphism group. Suppose that $X$ is equipped with several non-degenerate fixed point free $SL_2$-actions satisfying some mild additional assumption. Then…

Algebraic Geometry · Mathematics 2009-02-04 Fabrizio Donzelli , Alexander Dvorsky , Shulim Kaliman

A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…

Logic · Mathematics 2023-04-10 Valentina Harizanov , Keshav Srinivasan

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

Group Theory · Mathematics 2014-02-26 Carl G. Jockusch , Paul E. Schupp

Given a digraph $D$, we say that a set of vertices $Q\subseteq V(D)$ is a $q$-kernel if $Q$ is an independent set and if every vertex of $D$ can be reached from $Q$ by a path of length at most $q$. In this paper, we initiate the study of…

Combinatorics · Mathematics 2024-07-19 Sam Spiro

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Logic · Mathematics 2014-02-14 Joel David Hamkins

The Lebesgue dominated convergence theorem of the measure theory implies that the Riemann integral of a bounded sequence of continuous functions over the interval [ 0,1] pointwise converging to zero, also converges to zero. The validity of…

Functional Analysis · Mathematics 2008-09-03 Zoltan Kannai

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

Combinatorics · Mathematics 2017-02-28 Reinhard Diestel

A (generalized) topological space is called an iso-dense space if the set of all its isolated points is dense in the space. The main aim of the article is to show in $\mathbf{ZF}$ a new characterization of iso-dense spaces in terms of…

General Topology · Mathematics 2024-04-11 Tom Richmond , Eliza Wajch

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

Rings and Algebras · Mathematics 2023-08-31 Flavien Mabilat

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Combinatorics · Mathematics 2022-07-19 T. Mitchell Roddenberry , Santiago Segarra

Work in the measure algebra of the Lebesgue measure on the Cantor space: for comeager many $[A]$ the set of points $x$ such that the density of $x $ at $A$ is not defined is $\Sigma^{0}_{3}$-complete; for some compact $K$ the set of points…

Logic · Mathematics 2018-08-15 Alessandro Andretta , Riccardo Camerlo , Camillo Costantini

We consider Choquet integrals with respect to dyadic Hausdorff content of non-negative functions which are not necessarily Lebesgue measurable. We study the theory of Lebesgue points. The studies yield convergence results and also a density…

Functional Analysis · Mathematics 2025-03-10 Petteri Harjulehto , Ritva Hurri-Syrjänen

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…

General Topology · Mathematics 2015-12-29 V. V. Mykhaylyuk

A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\meg 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. A vector homogeneous tree $\mathbf{T}$…

Combinatorics · Mathematics 2014-10-23 Pandelis Dodos , Vassilis Kanellopoulos , Konstantinos Tyros

The general framework for integrable discrete systems on R in particular containing lattice soliton systems and their q-deformed analogues is presented. The concept of regular grain structures on R, generated by discrete one-parameter…

Exactly Solvable and Integrable Systems · Physics 2016-02-18 Maciej Blaszak , Metin Gurses , Burcu Silindir , Blazej M. Szablikowski
‹ Prev 1 3 4 5 6 7 10 Next ›