Related papers: Various Sequences from Counting Subsets

We study the typical behavior of the least common multiple of the elements of a random subset $A\subset \{1,\dots, n\}$. For example we prove that $\text{lcm}\{a:\ a\in A\}=2^{n(1+o(1))}$ for almost all subsets $A\subset\{1,\dots,n\}$.

A family of subsets of $\{1,\ldots,n\}$ is called {\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of…

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved

Our objective is to determine which subsets of $\mathbb{R}^d$ arise as escaping sets of continuous functions from $\mathbb{R}^d$ to itself. We obtain partial answers to this problem, particularly in one dimension, and in the case of open…

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Measuring the distance between data points is fundamental to many statistical techniques, such as dimension reduction or clustering algorithms. However, improvements in data collection technologies has led to a growing versatility of…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

Neural sequence-to-sequence models are well established for applications which can be cast as mapping a single input sequence into a single output sequence. In this work, we focus on one-to-many sequence transduction problems, such as…

We pose thirty conjectures on arithmetical sequences, most of which are about monotonicity of sequences of the form $(\root n\of{a_n})_{n\ge 1}$ or the form $(\root{n+1}\of{a_{n+1}}/\root n\of{a_n})_{n\ge1}$, where $(a_n)_{n\ge 1}$ is a…

We consider two problems regarding some divisibility properties of the subset sums of a set $A\subseteq \{1, 2, \ldots ,n\}$. At the beginning, we study the cardinality of $A$ which has the following property: For every $d\le n$ there is a…

This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…

We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the…

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Computing universal distributed representations of sentences is a fundamental task in natural language processing. We propose ConsSent, a simple yet surprisingly powerful unsupervised method to learn such representations by enforcing…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…