Related papers: The Postage Stamp Problem and Essential Subsets in…

This paper studies a version of the counting problem in dynamical systems that is of interest, especially in conformal dynamical systems where the functions of the systems are angle preserving. Recently, M. Pollicott and M. Urba\'{n}ski…

The Cage Problem requires for a given pair $k \geq 3, g \geq 3$ of integers the determination of the order of a smallest $k$-regular graph of girth $g$. We address a more general version of this problem and look for the $(k,g)$-spectrum of…

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge…

Given a function f with an absolutely convergent Fourier series, we define the norm of f as ||f||_A = the sum of absolute values of the Fourier coefficients of f. We study the behavior of ||f^n||_A as n goes to infinity, for f of the form…

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is…

In this work, we study the generalized k-th power symbol (a/n)_k and present a comprehensive collection of its algebraic properties. The results are classified according to their dependence on the three main parameters a, n, and k. In…

Let $I$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$. The asymptotic behaviour of the $\text{v}$-number of the powers of $I$ is investigated. Natural lower and upper bounds which are linear…

Let $P$ be a finite set of points in $\mathbb{R}^d$ or $\mathbb{C}^d$. We answer a question of Purdy on the conditions under which the number of hyperplanes spanned by $P$ is at least the number of $(d-2)$-flats spanned by $P$. In answering…

Let $H=(V,E)$ be an $s$-uniform hypergraph of order $n$ and $k\geq 0$ be an integer. A $k$-independent set $S\subseteq H$ is a set of vertices such that the maximum degree in the hypergraph induced by $S$ is at most $k$. Denoted by…

We asymptotically determine the maximum density of subgraphs isomorphic to $H$, where $H$ is any graph containing a dominating vertex, in graphs $G$ on $n$ vertices with bounded maximum degree and bounded clique number. That is, we…

The $K$-function is arguably the most important functional summary statistic for spatial point processes. It is used extensively for goodness-of-fit testing and in connection with minimum contrast estimation for parametric spatial point…

Nathanson introduced the range of cardinalities of $h$-fold sumsets $R(h,k) := \{|hA|:A \subset \mathbb{Z} \text{ and }|A| = k\}.$ Following a remark of Erd\H{o}s and Szemer\'edi that determined the form of $R(h,k)$ when $h=2$, Nathanson…

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

Let $\mathcal{H}=(V,\mathcal{E})$ be an $r$-uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1\le k\le r$. A $k$-\emph{matching} of $\mathcal{H}$ is a collection of edges $\mathcal{M}\subset \mathcal{E}$ such…

We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the…

Let $n,s,k$ be three positive integers such that $1\leq s\leq(n-k+1)/k$ and let $[n]=\{1,\ldots,n\}$. Let $H$ be a $k$-graph with vertex set $\{1,\ldots,n\}$, and let $e(H)$ denote the number of edges of $H$. Let $\nu(H)$ and $\tau(H)$…

Given an undirected unweighted graph $G = (V, E)$ on $n$ vertices and $m$ edges, a subgraph $H\subseteq G$ is a spanner of $G$ with stretch function $f: \mathbb{R}_+ \rightarrow \mathbb{R}_+$, if for every pair $s, t$ of vertices in $V$,…