English
Related papers

Related papers: Additive and multiplicative structure of c$^{\star…

200 papers

The observed clustering of Lyman-$\alpha$ lines is reviewed and compared with the clustering of CIV systems. We argue that a continuity of properties exists between Lyman-$\alpha$ and metal systems and show that the small-scale clustering…

Astrophysics · Physics 2007-05-23 S. Cristiani , S. D'Odorico , V. D'Odorico , A. Fontana , E. Giallongo , L. Moscardini , S. Savaglio

Let $T$ be a measure preserving $\mathbb{Z}^\ell$-action on the probability space $(X,{\mathcal B},\mu),$ $q_1,\dots,q_m:{\mathbb R}\to{\mathbb R}^\ell$ vector polynomials, and $f_0,\dots,f_m\in L^\infty(X)$. For any $\epsilon > 0$ and…

Dynamical Systems · Mathematics 2022-05-16 Andreas Koutsogiannis , Anh N. Le , Joel Moreira , Florian K. Richter

Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset…

Combinatorics · Mathematics 2026-04-15 R. Altar Ciceksiz , Victor Falgas-Ravry , Sabrina Lato , Maryam Sharifzadeh

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Combinatorics · Mathematics 2022-07-01 Robert Dougherty-Bliss

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

Let ${\mathbb F}$ be a field with characteristic not $2$, and $A_i\in{\mathbb F}^{m\times n},B_i\in{\mathbb F}^{n\times m},C_i\in{\mathbb F}^{m\times m}$, for $i=1,...,k$. In this short note, we obtain necessary and sufficient conditions…

Numerical Analysis · Mathematics 2014-11-04 Fernando De Terán

We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…

Number Theory · Mathematics 2010-09-15 Steven J. Miller , Brooke Orosz , Daniel Scheinerman

Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…

Functional Analysis · Mathematics 2020-08-11 Artur Bartoszewicz , Włodzimierz Fechner , Aleksandra Świątczak , Agnieszka Widz

A number $m$ is said to be a $\textit{de Polignac number}$, if infinitely many pairs of consecutive primes exist, such that $m$ can be written as the difference of those consecutive prime numbers. Recently in [ W. D. Banks: Consecutive…

Number Theory · Mathematics 2024-07-02 Sayan Goswami

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

The Ramsey Choice principle for families of $n$-element sets, denoted $\mathrm{RC}_n$, states that every infinite set $X$ has an infinite subset $Y\subseteq X$ with a choice function on $[Y]^n := \{z\subseteq Y : |z| = n\}$. We investigate…

Logic · Mathematics 2023-06-02 Lorenz Halbeisen , Riccardo Plati , Saharon Shelah

Suppose that (F_n)_{n=1}^{\infty} is a sequence of regular families of finite subsets of N and (\theta_n)_{n=1}^{\infty} is a nonincreasing null sequence in (0,1). The mixed Tsirelson space T[(\theta_{n}, F_n)_{n=1}^{\infty}] is the…

Functional Analysis · Mathematics 2007-05-23 Denny H. Leung , Wee-Kee Tang

A sum-network is an instance of a network coding problem over a directed acyclic network in which each terminal node wants to compute the sum over a finite field of the information observed at all the source nodes. Many characteristics of…

Information Theory · Computer Science 2018-01-30 Ardhendu Tripathy , Aditya Ramamoorthy

If we accept a paradigm that star formation is a self-similar, hierarchical process, then the Salpeter slope of the IMF for high-mass stars can be simply and elegantly explained as follows. If the instrinsic IMF at the smallest scales…

Solar and Stellar Astrophysics · Physics 2012-07-11 M. S. Oey

The structure of cloud complexes appears to be well described by a "tree structure" representation when the image is partitioned into "clouds". In this representation, the parent-child relationships are assigned according to containment.…

Astrophysics · Physics 2007-05-23 Nestor Sanchez , Antonio Parravano

In this work, we define new sequence spaces by combining generalized weighted mean and difference operator. Afterward, we investigate topological structure which are completeness, AK-property, AD-property. Also, we compute the alpha, beta…

Functional Analysis · Mathematics 2010-07-27 Harun Polat , Vatan Karakaya , Necip Simsek

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

Probability · Mathematics 2010-11-23 Jan Pachl

A family of $k$-subsets $A_1, A_2, ..., A_d$ on $[n]=\{1,2,..., n\}$ is called a $(d, c)$-cluster if the union $A_1\cup A_2 \cup ... \cup A_d$ contains at most $ck$ elements with $c<d$. Let $\mathcal{F}$ be a family of $k$-subsets of an…

Combinatorics · Mathematics 2009-04-24 William Y. C. Chen , Jiuqiang Liu , Larry X. W. Wang

It is known that there is a constant $c>0$ such that for every sequence $x_1, x_2,\ldots$ in $[0,1)$ we have for the star discrepancy $D^{*}_N$ of the first $N$ elements of the sequence that $N D^{*}_N\geq c\cdot \log N$ holds for…

Number Theory · Mathematics 2015-11-13 Gerhard Larcher , Florian Puchhammer

It was proved that whenever $\mathbb{N}$ is partitioned into finitely many cells, one cell must contain arbitrary length arithmetic and geometric progression nicely intertwined, so that one cell must be rich in the sense of containing…

Combinatorics · Mathematics 2012-01-24 Dibyendu De , Ram Krishna Paul