Related papers: Golden Ratio Nets and Sequences
I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain…
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…
In math.NT/0307308 we defined the irrationality base of an irrational number and, assuming a stronger hypothesis than the irrationality of Euler's constant, gave a conditional upper bound on its irrationality base. Here we develop the…
We propose a nonparametric framework for the analysis of networks, based on a natural limit object termed a graphon. We prove consistency of graphon estimation under general conditions, giving rates which include the important practical…
In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…
We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…
Let $K$ be a algebraically closed field of characteristic 0 that is complete with respect to a non-Archimedean absolute value. Let $\phi\in K(z)$ with $\textrm{deg}(\phi)\geq 2$. In this paper we establish uniform logarithmic…
It is well known that the golden ratio $\phi$ is the ''most irrational'' number in the sense that its best rational approximations $s/t$ have error $\sim 1/(\sqrt{5} t^2)$ and this constant $\sqrt{5}$ is as low as possible. Given a prime…
It is known that for an IP^{*} set A in (\mathbb{N},+) and a sequence \left\langle x_{n}\right\rangle _{n=1}^{\infty} in \mathbb{N}, there exists a sum subsystem \left\langle y_{n}\right\rangle _{n=1}^{\infty} of \left\langle…
We propose a new class of algebraic structure named as \emph{$(m,n)$-semihyperring} which is a generalization of usual \emph{semihyperring}. We define the basic properties of $(m,n)$-semihyperring like identity elements, weak distributive…
Fix an irrational number $\alpha$. Let $X_1,X_2,\cdots$ be independent, identically distributed, integer-valued random variables with characteristic function $\varphi$, and let $S_n=\sum_{i=1}^n X_i$ be the partial sums. Consider the random…
The theory of ternary $\Gamma$-semirings extends classical ring and semiring frameworks by introducing a ternary product controlled by a parameter set $\Gamma$. Building on the foundational axioms recently established by Rao, Rani, and…
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on $\Z/N\Z$ introduced by Gowers in his proof of Szemer\'edi's…
The characteristic sequence of hypergraphs $<P_n : n<\omega>$ associated to a formula $\phi(x;y)$, introduced in [arXiv:0908.4111], is defined by $P_n(y_1,... y_n) = (\exists x) \bigwedge_{i\leq n} \phi(x;y_i)$. This paper continues the…
The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…
Networks are fundamental to the study of complex systems, ranging from social contacts, message transactions, to biological regulations and economical networks. In many realistic applications, these networks may vary over time. Modeling and…
We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…
We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…