Papers

Upload paper
  1. Assume the sharp finite Gaussian propeller inequality and its finite equality classification. We prove that the deficit in the squared first-moment functional controls the square of the Gaussian measure distance to a propeller, with one positive constant independent of the ambient dimension and the number of cells. Cells may have arbitrarily small measure, and no masses are prescribed. The proof passes to countable Gaussian score arrays, excludes infinite-support equality cases, and bounds the gain from all additional scores by the three-halves power of their total squared norm and the squared

    1
  2. Assuming a specified moment-saving inequality for a preserved class of four-state posterior laws, we characterize reconstruction on deterministic locally finite trees with variable symmetric ferromagnetic edge channels by positivity of a weighted nonlinear capacity. The channel parameters may approach either zero or one, and perfectly transmitting edges are allowed. We give quantitative comparisons between capacity and limiting posterior information with constants independent of the tree, its degrees, and the edge parameters. The proof uses local posterior estimates valid without channel smoot

    1
  3. Assuming specified analytic estimates for shifted primes and Dirichlet LL-functions, we prove that Ω(p−1)\Omega(p-1) modulo any fixed positive integer is asymptotically uniform and independent of the ranked logarithmic prime factor sizes, for primes in each fixed reduced arithmetic progression. The factor-size limit is the Poisson--Dirichlet distribution with parameter one. For parity, we also obtain joint independence from the squarefree indicator, with its progression-dependent density. This gives the Moree--Hommersom parity conjecture under the same assumptions. The proof combines marked corre

    1
  4. Let HG(x)H_G(x) be the maximum entropy of a perfect-matching law with prescribed edge marginals xx in a finite loopless multigraph. We prove that, for every vertex vv,

    HG(x)≥−∑exelog⁡xe+32∑e∉δ(v)(1−xe)log⁡(1−xe).H_G(x)\ge-\sum_e x_e\log x_e +\frac32\sum_{e\notin\delta(v)}(1-x_e)\log(1-x_e).

    On 2m2m vertices this gives a coefficient 32(1−1/m)\frac32(1-1/m) in the unrooted complementary-entropy bound. The proof reserves the contribution of one vertex star. This makes the entropy deficit exactly additive under contraction of a tight odd cut and permits induction before a covariance second-variation argument. Boundary marginals and labelled p

    1
  5. For arbitrary finite player types of cardinality5, any matching of exactly3spouse pairs and any finite occurrence schedule, the literal Berman-Wakeling Source conditions are impossible. k means spouse pairs, not rounds; all original/final multiplicity clauses transported from arbitrary labels; no resolution/Latin/sign/cycle/identity premise added.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

    1
  6. For every discrete equal shoe-color law p, under literal independent strict left/right alternating arrivals, the total variation discrepancy between the independent conditional matching-pair color and actual first chronological opposite-side match color is at most255/256. Consequently the supremum over all countable laws is strictly below1; no finite-support restriction, positive-support-only premise, simultaneous-pair/random-side replacement or unproved law identity. Actual product/conditioning/stopping/fallback/TV/countable and finite-extension bridges proved.

    AI-assisted research preprint.

    1
  7. Two actual rank-seven full-support reduced doubly-even binary subspaces on Fin50, each with sorted type fifteen ones/seven fives, represent the SAME explicitly nonassociative Moufang loop by genuine source-sign multiplicative bijections, but no arbitrary Fin50 coordinate permutation carries one code to the other. Refutes the broad printed2019Conjecture1, with all factor, weight, quotient-type, sign, rank and transport bridges included.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty l

    1
  8. For positive n, M_n is zero plus the n-by-n 0/1 matrices X(d,k,m) supported on one contiguous block of one integer diagonal, with printed signed bounds. psi counts ORDERED pairs of nonzero operands whose ordinary matrix product is nonzero. Then 120 psi(n)=(n+1)^7-n^7-(n+1)^3+n^3. The n1 case is proved; all-Nat integer/rational theorems and independent n0 controls are a canonical extension, not separate credit.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the

    1
  9. For all t>=6 and1<=r<s<=t: D_k(r,t;n)>=D_k(s,t;n) for everyk>=3,n>=1; strictly greater for everyk>=2,n>max(t+3,16). Parts occur with multiplicity<k; occurrences counted with multiplicity; representative t means0.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

    1
  10. For every natural K >= 2 and covariance parameters d0 > 0, d1 > 0, -d1/(K-1) <= d2 <= d1, with K even or with K odd and d2 <= d1/2, there exists a rhombic approximate design on [-1,1]^K whose information determinant is at least that of every approximate design. Exact source conventions, ordinary proof, Lean endpoints and coverage/trust limits are supplied. AI-assisted research; no worldwide-priority certification or external journal peer review is asserted.

    1
  11. Refutes the exact source Conjecture25 that every8-regular optimal1-embedded graph on the Klein bottle is3-extendable. The literal reflected rectangle quotient [0,4]x[0,3], (0,y)(4,y), (x,0)(4-x,3), carries a connected simple12vertex8regular48edge graph with actual continuous injective edge arcs, good transverse1-embedding and canonical valid CW Euler characteristic0, hence48=412-40. Matching{{1,5},{3,9},{7,11}} has three edges,12>=8 and no perfect matching contains it: residual vertices form two odd triangles. Even-order witness and literal surface/drawing predicates; no torus-only theorem

    1
  12. For the source duplication-loss grammar on full binary unranked rooted species trees, with k>=1 species leaves and n extant gene leaves, prove all four claims of Conjecture4.1 (v1)/4.5 (final): one species-uniform eventual cutoff N_k makes caterpillar the count maximum and recursively leaf-balanced tree the count minimum, with equality exactly on their child-swap isomorphism classes; actual exponential growth factors exist, caterpillar growth/k tends to infinity, and balanced growth is Theta(k), explicitly 2k<=growth<=1000k for every positive k. Histories have ordered duplication, explicit spe

    1
  13. Refutes the prescribed-endpoint Hamiltonian-path characterization for Cartesian products of directed cycles: even for k=3, lengths(2,2,3), and distinct vertices u=(0,0,0),v=(0,0,1), directed distance1 satisfies distance congruent to -1 modulo gcd(2,2,3)=1, but no directed Hamiltonian path exists from u to v. Vertices are the actual dependent Cartesian product and arcs advance exactly one coordinate modulo its length; directed digons include both arcs. The result refutes both the displayed universal statement and its distinct-endpoint interpretation, with all factors of size>=2.

    AI-assisted re

    1
  14. Refutes the universal sparsity assertion for minimally AP-irreducible zero-diagonal sign patterns: an explicit order5 pattern has9 nonzero entries,exceeding2*5-2=8. AP means signed support irreducible,every row and every column positive,and Aplus-transpose(Aminus) irreducible,where Aminus retains negative entries. Every single nonzero-entry deletion fails AP. This concerns arXiv2112.00442v3 Conjecture5.1,not numerical algebraic-positive realizability Conjecture5.2.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal

    1
  15. For every odd n>=3, retain all n^2 board positions and every positive-step directed compass ray arc, including center outgoing arcs. Both upper-left beginning and center roots fixed. For arbitrary position permutation sigma and one GLOBAL8-direction permutation tau, S(A)(v)=tau(A(sigma(v))). S is universal iff FOR EVERY board A THERE EXISTS a doubly rooted digraph isomorphism A to S(A), possibly depending on A and unrelated to sigma. The set of actual universal board permutations is exactly identity and physical main-diagonal reflection, as one global group/set equality.

    AI-assisted research

    1
  16. For every positive natural m,d, the source sequence b_i = sum(h=0..m-1) ((i*(h-m+1)+m)/((h+1)*m))*fallingChoose(i-1+h,h)*fallingChoose(d-i+h,h) (all subtraction and falling products in R) acts diagonally on real polynomials of degree<=d, preserving zero-or-splitting over R. Weighted symbol is sum(i=0..d) choose(d,i)b_it^i. Includes arbitrary root signs,multiplicities,lower degree,constants and zero input. No m=0,negative-parameter,unweighted-symbol or unrelated Z/gamma assertion.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source

    1
  17. For every integer k>=3 and t>=0, there is one N(k,t)>=t+2 such that every n>=N and every finite simple undirected graph G on n vertices with f_k(G)<f_k(the(t+1)-edge star plus isolated vertices on n vertices) has G or its WHOLE complement within at most t unordered-pair edge flips of a complete bipartite graph, allowing empty cut parts. Here f_k counts ambient injective k-vertex cyclic orderings modulo rotations and reversal with an odd number of present G-edges; it does not count only graph-contained cycles. Includes genuine quotient/counting, exact threshold, common N, k3/t0, complement and

    1
  18. For every eventually minimizing choice of actual sum-Balaban-index dumbbells D(a,b,d), with positive integers a,b,d, a+b+d=n, a<=d, two disjoint cliques and a disjoint b-VERTEX path with EVERY clique vertex attached to its respective path endpoint, a/sqrt(n) and d/sqrt(n) tend to c=sqrt(sqrt(Q)), Q=sqrt(2)*log(1+sqrt(2)), and b/n tends to1. Includes actual graph distance/transmissions, real edge objective, all admissible competitors, attainment and all-minimizer uniformity. Not exact finite balance, not global minimum over all connected graphs.

    AI-assisted research preprint. Internal independ

    1
  19. Refutation of the literal broad arXiv2503.18490v1 Conjecture1.4: a finite abstract pure flag complex on540000 actual vertices,all facets of cardinality270000(dimension269999),has nonunimodal f-vector counting nonempty faces by dimension. Witness is the independence complex of the explicit mixed-clique-join graph with210000 isolated graph vertices/cone vertices. Actual vertex,purity,flag,face-coefficient,moment/window and f-vector bridges included. The original isolate-free graph conjecture remains UNREFUTED; no finite vertex-count minimality claim.

    AI-assisted research preprint. Internal inde

    1
  20. Refutation of arXiv2302.03647v2 Conjecture1: there is a five-vertex skeleton G, an acyclic orientation C and vertex4 whose sink orientation D is not Markov equivalent to C, while the segment between their characteristic imsets is not an edge (indeed not a face) of the convex hull of characteristic imsets of ALL acyclic orientations of G. All26 subset coordinates, genuine d-separation, actual sink operation and real convex-face bridge included. No general diameter-bound refutation or minimality claim.

    AI-assisted research preprint. Internal independent AI review is not external journal peer re

    1
  21. For every source-admissible Young diagram Y and every transversal T, every maximal legal rectangle-contained213-to123 move sequence terminates in the same213-avoiding transversal. All starts, sizes and board boundaries included; square confluence is prior and not credited separately. No arbitrary rewrite system or identical endpoint across different starts is claimed.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

    1
  22. For every integer n>=7, D(n)=binom(n,2)p(n)-sum_{lambda partitions n}Psi(lambda)>0, where p counts all ordinary partitions, L is positive row count, T=sum_i(i-1)lambda_i, h_j=column length and Psi=binom(L,2)+T+sum_{j>=1}h_jh_{j+1}, with zero column tails. No full finite-group integrality theorem is credited.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting qualifications.

    1
  23. For all naturals s, t with 2 <= t and t-1 <= s there is N depending only on s and t such that for every n >= N and every simple graph G on Fin n that is K_{t,s+1}-free in the ordinary non-induced sense, the largest element of the real spectrum of A + D is at most the printed bound n/2 + s + t - 2 + (1/2) sqrt((n-2+2s)^2 - 8s(n-2) + 4(t-1)(n-t+1)), and among such G equality holds exactly when G is isomorphic to the join of K_{t-1} and an s-regular graph on n-t+1 vertices. The equality clause is inside the freeness hypothesis, as in the source.

    AI-assisted research preprint. Internal independen

    1
  24. For every r and every rooted simple graph (K,o), along the n admitting a fullerene, the probability that the ball of radius r around a uniform root of a uniform isomorphism class of fullerene graphs on n vertices is rooted-isomorphic to the ball of (K,o) tends to 1 or 0 according as the corresponding ball of the hexagonal lattice of Eq. (3) is isomorphic to it; and the limit filter is proper. A fullerene is a finite connected cubic simple graph admitting a genus-0 rotation system with every face of length 5 or 6; balls use the strict inequality of the source.

    AI-assisted research preprint. In

    1
  25. tau(K_{2,l}) =Theta[atTop] sqrt l over l in Nat, for tau the list color function threshold, the smallest k >= chi(G) with P_l(G,m) = P(G,m) for every m >= k, defined by sInf over a set proved nonempty, on the actual mathlib completeBipartiteGraph (Fin 2) (Fin l). Also: for m >= 4 and 2l <= (m-1)^2, every m-assignment of K_{2,l} has at least m(m-1)^l + m(m-1)(m-2)^l proper list colourings.

    AI-assisted research preprint. Internal independent AI review is not external journal peer review. Exact source versions, formal coverage and bounded novelty limits are retained in the paper and supporting q

    1