Related papers: Odd number and Trapezoidal number

A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…

Let $F$ be a number field, and $D$ be a quaternion $F$-algebra. We show that the class number of any residually unramified $O_F$-order (e.g. an Eichler order) in $D$ is divisible by the class number of $F$.

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

The paper describes different approaches to generalize the trapezoidal method to fractional differential equations. We analyze the main theoretical properties and we discuss computational aspects to implement efficient algorithms. Numerical…

We will give a simple proof of the ambiguous class number formula.

We continue our study of a basic but seemingly intractable problem in integer partition theory, namely the conjecture that $p(n)$ is odd exactly $50\%$ of the time. Here, we greatly extend on our previous paper by providing a…

In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric)…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…

We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of…

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

In 2017, Igusa and Todorov gave a bijection between signed exceptional sequences and ordered partial clusters. In this paper, we show that every term in an exceptional sequence is either relatively projective or relatively injective or both…

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon \{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$ such that the pointwise…

We show that there is the same number of (n,l)-alternating sign trapezoids as there is of column strict shifted plane partitions of class l-1 with at most n parts in the top row, thereby proving a result that was conjectured independently…

We intend to contribute to the Collatz dynamics problem by seeking to analyze the Collatz conjecture from the tree of numbers sequences. First, we show numerically that the distribution of odd numbers has an initial transient, and proceeds…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…