Related papers: Natural Density and The Quantifier 'Most'
This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…
Fix integers $b>a\geq1$ with $g:=\gcd(a,b)$. A set $S\subseteq\mathbb{N}$ is \emph{$\{a,b\}$-multiplicative} if $ax\neq by$ for all $x,y\in S$. For all $n$, we determine an $\{a,b\}$-multiplicative set with maximum cardinality in $[n]$, and…
Simple representations of documents based on the occurrences of terms are ubiquitous in areas like Information Retrieval, and also frequent in Natural Language Processing. In this work we propose a logical-probabilistic approach to the…
In automatic summarization, centrality-as-relevance means that the most important content of an information source, or a collection of information sources, corresponds to the most central passages, considering a representation where such…
Given two sets of natural numbers $\mathcal{A}$ and $\mathcal{B}$ of natural density $1$ we prove that their product set $\mathcal{A}\cdot \mathcal{B}:=\{ab:a\in\mathcal{A},\,b\in\mathcal{B}\}$ also has natural density $1$. On the other…
Consider the set $M_{a,b} = \{n \in \mathbb Z_{\ge 1} : n \equiv a \bmod b\} \cup \{1\}$ for $a, b \in \mathbb Z_{\ge 1}$. If $a^2 \equiv a \bmod b$, then $M_{a,b}$ is closed under multiplication and known as an arithmetic congruence monoid…
Density matrices are the most general descriptions of quantum states, covering both pure and mixed states. Positive semidefiniteness is a physical requirement of density matrices, imposing nonnegative probabilities of measuring physical…
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…
Given a sequence composed of a limit number of characters, we try to "read" it as a "text". This involves to segment the sequence into "words". The difficulty is to distinguish good segmentation from enormous number of random ones.Aiming at…
This paper surveys the common approach to quantification and generalised quantification in formal linguistics and philosophy of language. We point out how this general setting departs from empirical linguistic data, and give some hints for…
We consider a finite universe U (more exactly - a family U of them) and second order quantifiers Q_K, where for each U this means quantifying over a family of n(K)-place relations closed under permuting U. We define some natural orders and…
Semantically non-compositional phrases constitute an intriguing research topic in Natural Language Processing. Semantic non-compositionality --the situation when the meaning of a phrase cannot be derived from the meaning of its components,…
In this paper, we study a parameter that is squeezed between arguably the two important domination parameters, namely the domination number, $\gamma(G)$, and the total domination number, $\gamma_t(G)$. A set $S$ of vertices in $G$ is a…
Several theoretical frameworks have been proposed to explain observed biodiversity patterns, ranging from the classical niche-based theories, mainly employing a continuous formalism, to neutral theories, based on statistical mechanics of…
Computational semantics and logic-based controlled natural languages (CNL) do not address systematically the word sense disambiguation problem of content words, i.e., they tend to interpret only some functional words that are crucial for…
Categorical compositional distributional model of Coecke et al. (2010) suggests a way to combine grammatical composition of the formal, type logical models with the corpus based, empirical word representations of distributional semantics.…
In this paper we prove that if $A$ and $B$ are infinite subsets of positive integers such that every positive integer $n$ can be written as $n=ab$, $a\in A$, $b\in B$, then $\displaystyle \lim_{x\to \infty}\frac{A(x)B(x)}{x}=\infty $. We…
This paper investigates two fundamental descriptors of data, i.e., density distribution versus mass distribution, in the context of clustering. Density distribution has been the de facto descriptor of data distribution since the…
Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…
The sizes of subsets of the natural numbers are typically quantified in terms of asymptotic (linear) and logarithmic densities. These concepts have been generalized to weighted $w$-densities, where a specific weight function $w$ plays a key…