
ALT Many scheduling problems need many different feasible timetables, and a view of how much freedom each event has. We study a Las Vegas algorithm that samples satisfying assignments of a Boolean formula one variable at a time: it draws each value from an estimate of its conditional probability, propagates, and restarts on a contradiction. Every output is a checked solution and comes with the exact probability of producing it. We prove that a run succeeds with probability at least 2⁻ᴷ, where K is the expected Kullback–Leibler divergence between the true and estimated conditional probabilities along the run of a uniform solution. We also bound the distance of the outputs from uniform from the samples alone; it is a divergence in the opposite direction to K, so a sampler can succeed more often while being farther from uniform. On generated timetabling instances counted exactly, belief propagation on the timetabling problem brings K to at most about one bit, and the estimated counts are with

ALT A finite nonempty set X ⊂ mathbbZ_>0 is (first-order) Schreier if |X| ≤ min X. These Schreier sets can be generalized recursively to higher-order Schreier sets, and we specifically investigate the second-order Schreier sets. We show that the count of second-order Schreier sets with minimum element 2 and maximum element n+4 is one more than the n^th term of the convolution of the Fibonacci numbers F₁, F₂, … with F₂, F₃, … (given by Sequence A023610 in the OEIS).

ALT In this paper, we present characterizations of Pettis integrability in bcc(X) and cwk(X) of a multifunction Γ: Ω→ cc(X), where (Ω, Σ, μ) is a complete finite measure space and cc(X) (bcc(X), cwk(X)) is the family of all nonempty convex closed (bounded convex closed, convex weakly compact) subsets of a Hausdorff locally convex topological vector space X. Incidentally, a convergence theorem for scalarly integrable multifunctions is proved. As an application, we are going to prove full characterizations of Pettis integrability for fuzzy maps defined on Ω and taking values in the generalized fuzzy number hyperspace ℱ_cwk(X).

ALT We study recurrences in which a previous sequence value determines the number of iterations of an inner map. Campbell's example has an explicit power-of-three formula and inner orbits of eventual period at most two. Its normalized lower and upper limits are 2/5 and 3/4. For a variable-depth Conway recurrence C, we prove the golden-ratio lower bound, its exact equality set, a Fibonacci upper cap, and the landing of the inner orbit at every Fibonacci index Fₖ with k≥6. These proofs are elementary and start from twenty-four initial values. The plateau of C to the left of Fₖ has width exactly ⌊(2k-9)/3⌋, and C(Fₖ+t)=Fₖ₋₁+t for 0≤ t≤⌊(k-8)/6⌋. A maximum principle turns a finite exact computation into the bound limsup C(n)/n<0.65446923. We characterize the convergence of C(n)/n to α=(√5-1)/2 in terms of negative selected orbit jumps and of a limiting convex profile, and we derive entropy and variance budgets for the recursive splits. Along inverse rays of the map x↦ C(x), the relative errors

ALT We derive a novel three-parameter master identity for Forsyth-Glaisher-type series for 1/π. By unifying disparate results from the literature into a single overarching framework, we demonstrate that Glaisher's original series and numerous known variations emerge naturally as special cases through systematic choices of the parameters. This master identity simplifies the derivation of existing formulas, provides a mechanism for generating an infinite number of new series for 1/π, and is further utilized to derive associated series involving harmonic and odd harmonic numbers.

ALT For integers k≥2 and λ₁,λ₂∈{-1,+1}, let Sₖλ₁λ₂:={n∈ℕ∖{0,1}:\gcd(nᵏ+λ₁,n!+λ₂)>1}. This family arose from a MathOverflow problem concerning the existence of integers n satisfying \gcd(n²+1,n!+1)>1 and from the subsequent question of whether arbitrarily many, but finitely many, solutions can be obtained by varying the exponent and the signs. We concentrate on the case λ₁=λ₂=-1 and introduce the notion of a universal invariant for an odd prime p, namely an integer n≥2 such that \gcd(nᵖ⋅ᵐ-1,n!-1)>1 for every integer m≥1. We prove that this condition is equivalent to \gcd(nᵖ-1,n!-1)>1, characterize the possible prime divisors in terms of roots of unity over finite fields, and recall an explicit construction due to Jonathan Love that yields a universal invariant for every odd prime p≥5, with the cubic case treated separately. As an application, we prove that |Sₖ⁻¹⁻¹|≥ω_odd(k) for every integer k≥2, where ω_odd(k) denotes the number of distinct odd prime divisors of k. Hence, the cardinalities

ALT A 0-1 polynomial is a polynomial whose coefficients are all either 0 or 1. The unfair 0-1 polynomial conjecture states that if f is a 0-1 polynomial and f(x)=g(x)h(x) is a factorisation into non-constant polynomials with non-negative real coefficients, then g and h must themselves be 0-1 polynomials. We call f fair if every such factorisation has this property, and unfair otherwise. In this paper, we study structural properties of possible unfair factorisations and obtain conditions which guarantee fairness. In particular, we prove that if f(x)=xⁿ⁻ᵈᵉᵍʷw(x)+v(x), where v and w are 0-1 polynomials and v is fair, then f is fair whenever n≥max{deg w+2deg v, 2deg w}.
![In this paper, we study a sequence bₙ, posed by Fei Wang, which is defined by b₁=¹⁄₃ and a convolution-type recursive relation. We derive the generating functions of nbₙ and of bₙ, the latter of which is lnᵃʳᶜᵗᵃⁿʰˣ⁄ₓ, and represent bₙ as a moment integral over [0,1] with a positive density. From this representation we prove that the sequence bₙ is positive and logarithmically convex, that the sequence nbₙ is strictly decreasing, and that the ratio ᵇⁿ⁺¹⁄bₙ is strictly increasing in n∈ℕ with limit 1, which answers Wang's problem. We also give a determinantal expression and closed-form formulas for bₙ involving Stirling numbers of the first kind and partial Bell polynomials. Finally, we prove that the function (1/(arctan x)) is logarithmically completely monotonic on (0,∞).](https://pbs.twimg.com/media/HWzRxhRW0AAAqal.png?name=small&format=webp)
ALT In this paper, we study a sequence bₙ, posed by Fei Wang, which is defined by b₁=¹⁄₃ and a convolution-type recursive relation. We derive the generating functions of nbₙ and of bₙ, the latter of which is lnᵃʳᶜᵗᵃⁿʰˣ⁄ₓ, and represent bₙ as a moment integral over [0,1] with a positive density. From this representation we prove that the sequence bₙ is positive and logarithmically convex, that the sequence nbₙ is strictly decreasing, and that the ratio ᵇⁿ⁺¹⁄bₙ is strictly increasing in n∈ℕ with limit 1, which answers Wang's problem. We also give a determinantal expression and closed-form formulas for bₙ involving Stirling numbers of the first kind and partial Bell polynomials. Finally, we prove that the function (1/(arctan x)) is logarithmically completely monotonic on (0,∞).

ALT This study focuses on modeling tumor–immune interactions through a fractional-order prey–predator framework, where tumor cells act as prey and immune effector cells as predators. To capture the hereditary and memory effects inherent in biological systems, we employ the Hilfer–Katugampola fractional derivative, which flexibly interpolates between Riemann–Liouville and Caputo formulations. In addition, a circuit-based analogy is introduced to map tumor proliferation, immune regulation, and therapeutic interventions onto resistive, capacitive, and inductive elements, providing intuitive interpretation of the dynamics. Analytical investigations, including equilibrium analysis and stability criteria, are conducted across varying fractional orders. Numerical simulations reveal that lower fractional orders lead to delayed oscillations, prolonged tumor persistence, and increased sensitivity to treatment strategies compared with classical integer-order models. The integration of fractional calc

ALT This paper is the third part of our detailed investigation of double sums where the inner sum is binomial but incomplete. We prove many identities for these double sums involving quotients of binomial coefficients and additional parameters. In addition, we evaluate some quadratic incomplete sums using Legendre polynomials.

ALT We study the prime supports that eliminate every representation of an even integer N by two positive integers coprime to 6P. Let J(k) be the largest vanishing instance obtainable with at most k factors of P not dividing N/2. We prove k(log k)²≪ J(k)≪ε k⁴⁺ε for every ε>0. The upper bound follows by comparing a classical family of shifted-prime representations with a two-dimensional upper sieve for the loss at each additional factor. Retaining the same local density factor in both estimates yields a weighted survival criterion and positivity whenever the number of noncolliding factors above Nᶿ is sufficiently small compared with Nᶿ, for fixed 0<θ<1/4. An exact reduction separates a minimum prime cover into forced prime-pair contributions and a residual problem, and gives the lower bound for J along powers of two. Residue occupancies characterize the extremal concentration at a first zero. Explicit discrepancy estimates show that supports with at most eleven factors cannot eliminate every

ALT We prove continuity for reflexive, bisymmetric binary operations that are strictly increasing in each variable, under certain algebraic conditions. In fact, for some algebraic weights we construct a weighted quasi-arithmetic representation of such functions without assuming continuity. An elementary construction gives the case r=2/3. More generally, a word equality whose polynomial difference has a unique simple zero r∈(0,1) forces the representation with weight r; every algebraic r with no other conjugate in (0,1) arises this way. The proof uses an affine embedding and a dense-domain extension argument.
![We further develop the theory of congruence speed for integer tetration in non-squarefree numeral systems, building on Appendix B of [M. Ripà and G. Di Pietro (2026), A compact notation for peculiar properties characterizing integer tetration, Notes on Number Theory and Discrete Mathematics, 32(3), 477-496]. For bases coprime to the radix, we establish an eventual floor-difference representation and determine the exact spectrum of attainable least periods. We construct explicit arithmetic progressions containing infinitely many prime bases with nonconstant congruence speed for every non-squarefree radix, thereby proving the coprime-infinitude conjecture posed in Appendix B. We also derive a uniform quadratic bound for the least coprime base with nonconstant congruence speed and establish exact natural densities of nonstabilizing bases, both among integers coprime to the radix and among those not divisible by its radical, together with the corresponding relative density among primes. Fi](https://pbs.twimg.com/media/HWykcalWoAEnLJg.png?name=small&format=webp)
ALT We further develop the theory of congruence speed for integer tetration in non-squarefree numeral systems, building on Appendix B of [M. Ripà and G. Di Pietro (2026), A compact notation for peculiar properties characterizing integer tetration, Notes on Number Theory and Discrete Mathematics, 32(3), 477-496]. For bases coprime to the radix, we establish an eventual floor-difference representation and determine the exact spectrum of attainable least periods. We construct explicit arithmetic progressions containing infinitely many prime bases with nonconstant congruence speed for every non-squarefree radix, thereby proving the coprime-infinitude conjecture posed in Appendix B. We also derive a uniform quadratic bound for the least coprime base with nonconstant congruence speed and establish exact natural densities of nonstabilizing bases, both among integers coprime to the radix and among those not divisible by its radical, together with the corresponding relative density among primes. Fi

ALT Let Pa,b,u(t) be Sharipov's even monic degree-12 third cuboid polynomial, with positive pairwise distinct rational parameters. We prove a uniform normal form for its complete factorization over ℚ. Every factorization consists of at most two even quadratic factors, even irreducible factors of higher degree, and pairs of irreducible factors exchanged by t↦-t. After dividing all degrees by the contribution of this symmetry, the normal form satisfies one degree equation, one sign equation, and an obligatory-factor alternative: an even irreducible factor of degree at least six, or an even irreducible quartic with positive rational-square constant term. The arithmetic input is a uniform construction over ℚ₂, using Newton polygons, Hensel lifting, and a norm obstruction from ℚ₂(i). Valuations at all finite primes constrain rational factor constants to signed squares, while the real root equation gives exactly two simple negative roots of the auxiliary sextic. The normal form leaves exactly 22

ALT We introduce the notion of graded-edge Rakotch contraction mappings on a generalized metric space with a weighted graph. We prove that the successive iterate of every starting point converge uniformly to a common limit, which is the unique fixed point. We derive an explicit iteration-complexity bound and, under a relaxed triangle inequality, a geometric rate whose constant is the graph invariant. Finally, we illustrate the theory on an explicit real graded contraction that realizes the interior optimum, on a quadratic integral equation, and on finite weighted digraphs.

ALT Mahjong is a traditional tile-based game popular in East and Southeast Asia. Combinatorial study of Mahjong hands has been a topic of interest in recreational mathematics, with the Nine Gates hand being a well-known example. This single-suit Mahjong hand {1,1,1,2,3,4,5,6,7,8,9,9,9} consists of 13 tiles of a single suit ranked 1 through 9, arranged such that drawing any tile from that suit completes a winning hand of a pair and 4 melds, regardless of the tile's rank. Folklore has circulated that Nine Gates is the unique single-suit hand with this 9-sided-wait property. While prior works have verified this uniqueness by exhaustive computer enumeration across different finite configurations, we present a general classification of full-sided waits for Mahjong variants with 3n ranks and n+1 melds. For every n≥2, we report exactly 8 full-sided waits, of which Nine Gates is the unique live one. Notably, our proof requires no exhaustive enumeration or any prior knowledge of the classification




