English
Related papers

Related papers: Farey sequence and Graham's conjectures

200 papers

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T|<= mu, I subseteq C, |I| >=beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an…

Logic · Mathematics 2009-02-15 Saharon Shelah

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

For a given pair of two graphs $(F,H)$, let $R(F,H)$ be the smallest positive integer $r$ such that for any graph $G$ of order $r$, either $G$ contains $F$ as a subgraph or the complement of $G$ contains $H$ as a subgraph. Baskoro, Broersma…

Combinatorics · Mathematics 2017-01-24 Shin-ya Kadota , Tomokazu Onozuka , Yuta Suzuki

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

Computational Geometry · Computer Science 2011-08-23 Boris Aronov , Dmitriy Drusvyatskiy

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of…

Combinatorics · Mathematics 2017-07-31 Jan Hladky , Diana Piguet

Let $G$ be a simple graph with $n$ vertices and $e(G)$ edges, and $q_1(G)\geq q_2(G)\geq\cdots\geq q_n(G)\geq0$ be the signless Laplacian eigenvalues of $G.$ Let $S_k^+(G)=\sum_{i=1}^{k}q_i(G),$ where $k=1, 2, \ldots, n.$ F. Ashraf et al.…

Combinatorics · Mathematics 2013-06-04 Lihua You , Jieshan Yang

We establish the limiting distribution of certain subsets of Farey sequences, i.e., sequences of primitive rational points, on expanding horospheres in covers $\Delta\backslash\mathrm{SL}(n+1,\mathbb{R})$ of…

Dynamical Systems · Mathematics 2017-12-29 Byron Heersink

Relational Databases are universally conceived as an advance over their predecessors Network and Hierarchical models. Superior in every querying respect, they turned out to be surprisingly incomplete when modeling transitive dependencies.…

Databases · Computer Science 2007-05-23 Vadim Tropashko

A space $X$ is M-separable (selectively separable) (Scheepers, 1999; Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and…

General Topology · Mathematics 2025-11-07 Debraj Chandra , Nur Alam , Dipika Roy

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

In this paper we generalize some of our results from, `A note on Farey fractions with odd denominators' to subsets of Farey fractions consisting of fractions with denominators not divisible by a given prime. We also investigate the joint…

Number Theory · Mathematics 2009-07-14 Alan K. Haynes

The {Farey fractions} $F_n$ of order $n$ consist of all fractions $\frac{h}{k}$ in lowest terms lying in the closed unit interval and having denominator at most $n$. This paper considers the products $F_n$ of all nonzero Farey fractions of…

Number Theory · Mathematics 2017-08-07 Jeffery Lagarias , Harsh Mehta

A class of increasing sequences of natural numbers $(n_k)$ is found for which there exists a function $f\in L[0,1)$ such that the subsequence of partial Walsh-Fourier sums $(S_{n_k}(f))$ diverge everywhere. A condition for the growth order…

Analysis of PDEs · Mathematics 2019-12-11 Ushangi Goginava , Giorgi Oniani

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the…

Combinatorics · Mathematics 2022-06-10 Marcelo Sales , Bjarne Schülke

We recursively define a sequence $\{F_{n,k}\}_{n,k\in\mathbb N }$ and we prove that such sequence contains only the symbols $\{0,1\}.$ We investigate some number-theoretic properties of such sequence and of the way it can be generated. The…

Number Theory · Mathematics 2023-10-26 Niccolò Castronuovo

Let $K$ be a compact convex set in $\mathbb{R}^2$ and let $\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3$ be finite families of translates of $K$ such that $A \cap B \neq \emptyset$ for every $A \in \mathcal{F}_i$ and $B \in \mathcal{F}_j$…

Combinatorics · Mathematics 2023-06-21 Cuauhtemoc Gomez-Navarro , Edgardo Roldán-Pensado

We derive a formula for the reliability of a $d$-dimensional consecutive-$k$-out-of-$n$:F system. That is, a formula for the probability that an $n_1 \times \ldots \times n_d$ array whose entries are (independently of each other) $0$ with…

Combinatorics · Mathematics 2015-08-17 Simon Cowell

This paper presents results about the distribution of subsequences which are typical in the sense of Baire. The first part is concerned with sequences of the type x_k = n_k*alpha, n_1 < n_2 < n_3 < ..., mod 1. Improving a result of Salat we…

Number Theory · Mathematics 2007-11-22 Martin Goldstern , Jörg Schmeling , Reinhard Winkler
‹ Prev 1 4 5 6 7 8 10 Next ›