
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,∞).


