Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA theorem about partitioning consecutive numbers
105
0
0.0
(
0
)
Authors
Kai Michael Renken
Ask ChatGPT about the research
No Arabic abstract
In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an interesting statement about triangular numbers, those positive integers which can be partitioned into consecutive numbers beginning at 1. For every partition of a triangular number n into consecutive numbers we can partition the sequence of numbers beginning at 1, adding up to n again, such that every part of this partition adds up to exactly one number of the chosen partition of n.
rate research
Read More
For a real number $t$, let $r_ell(t)$ be the total weight of all $t$-large Schr{o}der paths of length $ell$, and $s_ell(t)$ be the total weight of all $t$-small Schr{o}der paths of length $ell$. For constants $alpha, beta$, in this article we derive recurrence formulae for the determinats of the Hankel matrices $det_{1le i,jle n} (alpha r_{i+j-2}(t) +beta r_{i+j-1}(t))$, $det_{1le i,jle n} (alpha r_{i+j-1}(t) +beta r_{i+j}(t))$, $det_{1le i,jle n} (alpha s_{i+j-2}(t) +beta s_{i+j-1}(t))$, and $det_{1le i,jle n} (alpha s_{i+j-1}(t) +beta s_{i+j}(t))$ combinatorially via suitable lattice path models.
A defensive $k$-alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at least $k$ more neighbors in $S$ than it has outside of $S$. A defensive $k$-alliance $S$ is called global if it forms a dominating set. In this paper we study the problem of partitioning the vertex set of a graph into (global) defensive $k$-alliances. The (global) defensive $k$-alliance partition number of a graph $Gamma=(V,E)$, ($psi_{k}^{gd}(Gamma)$) $psi_k^{d}(Gamma)$, is defined to be the maximum number of sets in a partition of $V$ such that each set is a (global) defensive $k$-alliance. We obtain tight bounds on $psi_k^{d}(Gamma)$ and $psi_{k}^{gd}(Gamma)$ in terms of several parameters of the graph including the order, size, maximum and minimum degree, the algebraic connectivity and the isoperimetric number. Moreover, we study the close relationships that exist among partitions of $Gamma_1times Gamma_2$ into (global) defensive $(k_1+k_2)$-alliances and partitions of $Gamma_i$ into (global) defensive $k_i$-alliances, $iin {1,2}$.
We settle the existence of certain anti-magic cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemanns function in the domain that goes from 2 to 1010 at least. Instead of using a constant as was done by Legendre and others in the formula of Gauss, we try to adjust the data through a function. This function has the remarkable property: its points of discontinuity are the prime numbers.
Let $pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, we show that the expected number of distinct consecutive patterns in $pi_n$ is $frac{n^2}{2}(1-o(1))$. This exhibits the fact that random permutations pack consecutive patterns near-perfectly.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
