相关论文: Comparing balanced $\mathbb{Z}_v$-sequences obtain…

We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…

We study several combinatorial properties of finite groups that are related to the notions of sequenceability, R-sequenceability, and harmonious sequences. In particular, we show that in every abelian group $G$ with a unique involution…

S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if $G$ is a nontrivial finite group which is…

We show that functions of type $X_n = P[Z^n]$, where $P[t]$ is a periodic function and $Z$ is a generic real number, can produce sequences such that any string of values $X_{s}, X_{s+1}, ...,X_{s+m}$ is deterministically independent of past…

Given a square matrix $A$ over the integers, we consider the $\mathbb{Z}$-module $M_A$ generated by the set of all matrices that are permutation-similar to $A$. Motivated by analogous problems on signed graph decompositions and block…

This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…

An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive randomness is closed under computable permutations. We…

Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…

In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…

For each of the $15$ known sporadic Ap\'ery-like sequences, we prove congruences modulo $p^2$ that are natural extensions of the Lucas congruences modulo $p$. This extends a result of Gessel for the numbers used by Ap\'ery in his proof of…

A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…

Natural numbers satisfying a certain unusual property are defined by the author in a previous note. Later, the author called such numbers $v$-palindromic numbers and proved a periodic phenomenon pertaining to such numbers and repeated…

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected…

We study probability distributions of convergent random series of a special structure, called perpetuities. By giving a new argument, we prove that such distributions are of pure type: degenerate, absolutely continuous, or continuously…

We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…

We focus on Gr\"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no…

An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Qualitative and quantitative aspects for variational inequalities governed by strongly pseudomonotone operators on Hilbert space are investigated in this paper. First, we establish a global error bound for the solution set of the given…

Exploiting the recent work of Tao and Ziegler on a concatenation theorem on factors, we find explicit characteristic factors for multiple averages along polynomials on systems with commuting transformations, and use them to study criteria…