中文
相关论文

相关论文: Dominating numbers for countable structures

200 篇论文

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

组合数学 · 数学 2017-11-28 Zoltán Lóránt Nagy

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

数论 · 数学 2020-01-07 Sándor Z. Kiss , Csaba Sándor

Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…

泛函分析 · 数学 2024-07-18 Silvano Delladio

The generalisation of continuous orthogonal polynomial ensembles from random matrix theory to the $q$-lattice setting is considered. We take up the task of initiating a systematic study of the corresponding moments of the density from two…

数学物理 · 物理学 2021-10-27 Peter J Forrester , Shi-Hao Li , Bo-Jian Shen , Guo-Fu Yu

We investigate the question of whether or not the orbit of a point in A/Q, under the natural action of a subset S of Q, is dense in A/Q. We prove that if the set S is a multiplicative semigroup which contains at least two multiplicatively…

数论 · 数学 2013-03-08 Alan Haynes , Sara Munday

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

数论 · 数学 2007-05-23 Greg Martin , Kevin O'Bryant

We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…

组合数学 · 数学 2016-07-25 Adam W. Marcus

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

组合数学 · 数学 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

Let $K\subset\mathbb{R}$ be a self-similar set defined on $\mathbb{R}$. It is easy to prove that if the Lebesgue measure of $K$ is zero, then for Lebesgue almost every $t$, $$K+t=\{x+t:x\in K\}$$ only consists of irrational or…

数论 · 数学 2022-03-29 Qi Jia , Yuanyuan Li , Kan Jiang

Let X be a non-empty set and U a ring of subsets of X. The countable additive functions U->{0,1} are called measures. The paper gives some definitions (derivable measures, the Lebesgue-Stieltjes measures) and properties of these functions,…

综合数学 · 数学 2007-05-23 Serban E. Vlad

L^p spaces of mappings taking values in arbitrary metric spaces, which we call nonlinear Lebesgue spaces, play an important role in several fields of mathematics. For instance, membership in these spaces is typically required for transport…

泛函分析 · 数学 2026-03-10 Guillaume Sérieys , Alain Trouvé

For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent tree. We also give conditions on a rooted digraph G which allow us to construct a countable…

组合数学 · 数学 2011-04-08 Daniela Amato , David M. Evans , John K. Truss

A $k-$quasiperfect dominating set ($k\ge 1$) of a graph $G$ is a vertex subset $S$ such that every vertex not in $S$ is adjacent to at least one and at most k vertices in $S$. The cardinality of a minimum k-quasiperfect dominating set in…

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

组合数学 · 数学 2014-01-14 Robert Brignall , Nik Ruskuc , Vince Vatter

Definitions of dense linear orders (with/without endpoints), separable linear orders, complete linear orders, the countable chain condition for linear orders, a Suslin line/Suslin tree and Suslin's problem Statement and proof of Cantor's…

数论 · 数学 2025-08-22 Trey Smith , Aksel Ozer

Given a smooth function f on R^n and a submanifold M, we prove that the set of diagonal quadratic forms q such that the restriction of f+q to M is Morse is a dense set (in the n-dimensional space of diagonal quadratic forms). The standard…

微分几何 · 数学 2011-11-17 Antonio Lerario

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…

计算复杂性 · 计算机科学 2007-05-23 Michel Rigo

We give a definition of representability for distributive quasi relation algebras (DqRAs). These algebras are a generalisation of relation algebras and were first described by Galatos and Jipsen (2013). Our definition uses a construction…

逻辑 · 数学 2025-03-11 Andrew Craig , Claudette Robinson

In general, some of the well known results of measure theory dealing with the convergence of sequences of functions such as the Dominated Convergence Theorem or the Monotone Convergence Theorem are not true when we consider arbitrary nets…

泛函分析 · 数学 2023-07-19 Daniel L. Rodríguez-Vidanes

For each vector $x\in \ell^{\infty}$, we can define the non-empty compact set $L_x$ of accumulation points of $x$. Given an infinite subset $A$ of $\mathbb{N}\backslash\{1\}$, we can therefore investigate under which conditions on $A$, the…

泛函分析 · 数学 2023-03-08 Quentin Menet , Dimitris Papathanasiou