
ALT We introduce three families of discrete hyperbolic cosecant probability distributions, supported either bilaterally on ℤ or unilaterally on ℕ₀, inspired by series evaluations of Srinivasa Ramanujan. We determine their exact normalization constants in terms of singular values of complete elliptic integrals and the Gaußian constant G=ϖ/π with the lemniscate constant Γ²(1/4)/(2√(2π)) by explicitly calculating some series, e. g. ∑κ∈ℤ 2κcosech(κπ) = G² + (1/π). Furthermore, by connecting these distributions to Fourier transforms of powers of the hyperbolic secant and applying the Poisson summation formula, we obtain closed-form evaluations for even moments and hyperbolic secant lattice sums, e. g. ∑ₖ∈ℤ sech⁴(k π) = ⅔ (G⁴ + G² + (1/π)). This machinery proves conjectures on lattice sums arising in electrostatics proposed by Vigren and Dieckmann (Symmetry, 2020).

ALT A strict unit-triangle configuration is a finite connected family of closed equilateral unit triangles in which distinct triangles are disjoint or meet at a common vertex, and no vertex belongs to more than two triangles. A vertex belonging to exactly one triangle is a pole. We prove that every strict configuration with one or two poles contains at least fourteen triangles, a sharp bound for two poles attained by the double kite and the reverse double kite. A strict four-regular configuration whose contact graph has an edge cut of size at most two contains at least twenty-eight triangles. A decomposition into three strict two-pole components requires forty-two triangles; both known ring constructions attain the bound. The proof reduces minimal counterexamples to two-connected contact graphs, applies area bounds to complementary unit-sided polygons, and excludes the remaining cases by exact angle certificates. The supplement contains 13,668 stored marked records, 233 exclusion certifica

ALT Let R be a commutative Krasner hyperring with identity and M an R-hypermodule. We consider the prime spectrum Spec_R(M), consisting of all prime subhypermodules of M. In this paper, we introduce a Zariski topology on Spec_R(M) and investigate its fundamental topological properties, including irreducibility, connectedness, compactness, and separation axioms, providing necessary and sufficient conditions for each. In particular, we prove that Spec_R(M) is irreducible if and only if the nilradical of M is a prime hyperideal, and that it is connected precisely when the underlying hyperring is not a nontrivial direct product. We further investigate the functoriality of the Zariski topology in the category of Krasner hyperrings and hypermodules. Moreover, using the fundamental relation ε, the smallest regular relation on M for which the quotient M̅=M/ε becomes an R̅=R/Γ*-module, we establish a correspondence between the Zariski topologies of M and M̅. We show that this correspondence is func

ALT In SET, each card has four properties with three values each, and three cards form a set when every property is all the same or all different. We prove that the maximum number of sets among 13, 14, 15, and 16 cards is 16, 19, 23, and 26, respectively. Viewing cards as points of F₃⁴ and sets as lines, we show that a configuration that leaves one of the 40 line directions of F₃⁴ unused projects into F₃³ without losing a set, which reduces the problem to three properties, where exhaustive search is feasible. We force an unused direction by counting repeated directions in the planes through a card on many sets, and treat configurations containing a magic square separately.

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
