相关论文: Carry Propagation in Multiplication by Constants

Let ($X,Y)$ be a random vector with distribution function $F(x,y),$ and $(X_{1},Y_{1}),(X_{2},Y_{2}),...,(X_{n},Y_{n})$ are independent copies of ($X,Y).$ Let $X_{i:n}$ be the $i$th order statistics constructed from the sample…

We derive and analyze new diffusion approximations of stationary distributions of Markov chains that are based on second- and higher-order terms in the expansion of the Markov chain generator. Our approximations achieve a higher degree of…

Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is…

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…

In a quantum dot with three leads the transmission matrix t_{12} between two of these leads is a truncation of a unitary scattering matrix S, which we treat as random. As the number of channels in the third lead is increased, the…

We show that a particular form of target propagation, i.e., relying on learned inverses of each layer, which is differential, i.e., where the target is a small perturbation of the forward propagation, gives rise to an update rule which…

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…

We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters…

An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…

We consider Subtraction Nim, where two players have exactly the same options, but which is partizan in the sense that at the game ending, a partizan rule is applied for the decision of the winner. We consider the following example: Let $S$…

In this paper we study systems of $N$ uniformly expanding coupled maps when $N$ is finite but large. We introduce self-consistent transfer operators that approximate the evolution of measures under the dynamics, and quantify this…

It is known that any $n$-variable function on a finite prime field of characteristic $p$ can be expressed as a polynomial over the same field with at most $p^n$ monomials. However, it is not obvious to determine the polynomial for a given…

We propose a black-box variational inference method to approximate intractable distributions with an increasingly rich approximating class. Our method, termed variational boosting, iteratively refines an existing variational approximation…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations…

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to…

Given a directed graph $G$, the spread of $G$ is the largest distance between any two eigenvalues of its adjacency matrix. In 2022, Breen, Riasanovsky, Tait, and Urschel asked what $n$-vertex directed graph maximizes spread, and whether…

Condensation is the phenomenon whereby one of a sum of random variables contributes a finite fraction to the sum. It is manifested as an aggregation phenomenon in diverse physical systems such as coalescence in granular media, jamming in…

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…