Related papers: Non-dominating sequences of vectors using only res…

We adapt the construction of subsets of {1, 2, ..., N} that contain no k-term arithmetic progressions to give a relatively thick subset of an arbitrary set of N integers. Particular examples include a thick subset of {1, 4, 9, ..., N^2}…

We introduce and solve exactly a family of invariant 2x2 random matrices, depending on one parameter \eta, and we show that rotational invariance and real Dyson index \beta are not incompatible properties. The probability density for the…

Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these…

We study the asymptotic behavior of permanents of $n \times n$ random matrices $A$ with positive entries. We assume that $A$ has either i.i.d. entries or is a symmetric matrix with the i.i.d. upper triangle. Under the assumption that…

For real numbers a, b> 1, let as a_b denote the result of interpreting a in base b instead of base 10. We define ``dungeons'' (as opposed to ``towers'') to be numbers of the form a_b_c_d_..._e, parenthesized either from the bottom upwards…

In this note, we show that the domination number of the $2$-token graph of the path graph of order $n\geq 2$ is equal to $\frac{n^2}{10}+\Theta(n)$.

The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…

The exponential ordering is exploited in the context of non-auto\-no\-mous delay systems, inducing monotone skew-product semiflows under less restrictive conditions than usual. Some dynamical concepts linked to the order, such as…

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

A sequence of approximations for the determinant and its logarithm of a complex matrixis derived, along with relative error bounds. The determinant approximations are derived from expansions of det(X)=exp(trace(log(X))), and they apply to…

In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…

The Possible Winner problem asks, given an election where the voters' preferences over the candidates are specified only partially, whether a designated candidate can become a winner by suitably extending all the votes. Betzler and Dorn [1]…

Let $\sigma(n)$ to be the sum of the positive divisors of $n$. A number is non-deficient if $\sigma(n) \geq 2n$. We establish new lower bounds for the number of distinct prime factors of an odd non-deficient number in terms of its second…

In this paper we will explore two different proposals for the action for causal sets: the Benincasa-Dowker action and a modified version of the chain action. We propose a variational principle for two-dimensional causal sets and use it for…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or…

In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…

In a recent breakthrough Kelley and Meka proved a quasipolynomial upper bound for the density of sets of integers without non-trivial three-term arithmetic progressions. We present a simple modification to their method that strengthens…

This paper presents a new approach to evaluating the special values of the Dirichlet beta function, $\beta(2k+1)$, where $k$ is any nonnegative integer. Our approach relies on some properties of the Euler numbers and polynomials, and uses…

We show that for any fixed $\eps>0$, there are numbers $\delta>0$ and $p_0\ge 2$ with the following property: for every prime $p\ge p_0$ and every integer $N$ such that $p^{1/(4\sqrt{e})+\eps}\le N\le p$, the sequence $1,2,...,N$ contains…