Related papers: Containment in (s,t)-core Partitions

We further explore a connection initially unveiled in Iksanov (2025) between critical beta-splitting trees and infinite `balls-in-boxes' schemes. Using the connection, we derive a new joint central limit theorem for components of the height…

Here we have studied the ideas of g*-closed sets, g^tou -sets and Lamda*-closed sets and investigate some of their properties in the spaces of A. D. Alexandroff [1]. We have also studied few separation axioms like T-omega/4,T-3omega/8,…

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

The \theta-closed hull of a set A in a topological space is the smallest set C containing A such that, whenever all $closed$ neighborhoods of a point intersect C, this point is in C. We define a new topological cardinal invariant function,…

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

The purpose of this book is to lay out certain aspects of descriptive set theory. After initially establishing notation and generalities we proceed to the following topics: partitions, semirings, rings, $\sigma$-rings, $\delta$-rings,…

In this paper, we propose a partitioning technique that decomposes a pair of sequences with overlapping $t$-deletion $s$-substitution balls into sub-pairs, where the $^{\leq}t$-burst-deletion balls of each sub-pair intersect. This…

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

Motivated by applications in DNA-based storage and communication systems, we study deletion and insertion errors simultaneously in a burst. In particular, we study a type of error named $t$-deletion-$s$-insertion-burst ($(t,s)$-burst for…

We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…

A model is developed for the hadronic and electromagnetic interaction in the two-nucleon system above pion threshold in the framework of meson, nucleon and $\Delta$ degrees of freedom. It is based on time-ordered perturbation theory and…

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…

The aim of this note is to show that every subset of a given topological space is the intersection of a preopen and a preclosed set, therefore $\beta$-locally closed, and that every topological space is $\beta$-submaximal.

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…

The structures, the electromagnetic transitions, and the beta decay strengths of exotic nuclei are investigated within an extended cluster model. We start by deriving an effective nuclear Hamiltonian within the $S_2$ correlation operator.…

Let S and T be sets of positive integers and let a be a fixed positive integer. An a-shifted partition identity has the form p(S,n)=p(T,n-a), for all n greater or equal to a. Here p(S,n) is the number partitions of n whose parts are…

A partition is $t$-regular if none of its parts is divisible by $t$. Let $p(N,t)$ be the number of $(t+1)$-regular partitions of a positive integer $N$. In 1971, Hagis proved an asymptotic formula for $p(N,t)$ using the circle method, when…

For any positive integers $s$ and $t$, let $Q_{t}^{s}(n)$ denotes the number of partitions of a positive integer $n$ into distinct parts such that no part is congruent to $s$ or $t-s$ modulo $t$. We prove some Ramanujan-type congruences for…

We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…