SearcharxivSearch

arXiv subjects

Wai Yan Pong

Publications and source records attributed to Wai Yan Pong.

7 recordsLinked to original sources

Bundles of Probability Schemes

We study finite probability through a category whose objects are finite probability schemes and whose morphisms are probability-preserving maps, called bundles. A bundle simultaneously records a quotient of a sample space, the corresponding algebra of random variables, and the conditional schemes on its fibers. The pullback, transfer, and fiberwise averaging maps associated with a bundle give a functorial construction of conditional expectation and its projection properties. This recovers serveral fundamental results in elementary probability. Fiber products of bundles encode conditional independence, and iterated fiber products describe finite Markov chains from their adjacent-pair distribution schemes. Finally, the transfer map is identified with a relative trace, so the projection formula and base-change identity become instances of Frobenius reciprocity and Beck--Chevalley condition.

math.PR

The Integral of Secant and Stereographic Projections of Conic Sections

We show that the four best-known substitutions used to integrate secant rely on different rational parametrizations of conic sections, coming from stereographic projections. We also investigate other possible explanations for the four substitutions, as well as connections between the buildups leading to them.

math.HO

Wronskians and Linear Dependence of Formal Power Series

We give a new proof of the fact that the vanishing of generalized Wronskians implies linear dependence of formal power series in serveral variables. Our results are also valid for quotients of germs of analytic functions.

math.AC

Diophantine Equations of Matching Games I

We solve a family of quadratic Diophantine equations associated to a simple kind of games. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.

math.CO

Length Spectra of Natural Numbers

Two numbers are spectral equivalent if they have the same length spectrum. We show how to compute the equivalence classes of this relation. Moreover, we show that these classes can only have either 1,2 or infinitely many elements.

math.NT

Sums of Consecutive Integers

A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by their lengths and introduce the concept of length spectrum. Also, we use diagrams to illustrate the ideas behind our proofs.

math.HO