English
Related papers

Related papers: A Counter Example to the Shuffle Compatiblity Conj…

200 papers

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

Computational Complexity · Computer Science 2020-04-21 Justin Holmgren , Alexander S. Wein

In this article, we study about the $\lambda$-statistical convergence with respect to the density of moduli and find some results related to statistical convergence as well. Also we introduce the concept of $f_\lambda$-summable sequence and…

Functional Analysis · Mathematics 2016-03-31 Stuti Borgohain , Ekrem Savas

In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously…

Combinatorics · Mathematics 2025-08-29 Alessandro Iraci , Roberto Pagaria , Giovanni Paolini

In probability and statistics, copulas play important roles theoretically as well as to address a wide range of problems in various application areas. We introduce the concept of multivariate discrete copulas, discuss their equivalence to…

Methodology · Statistics 2015-12-18 Roman Schefzik

Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three…

Combinatorics · Mathematics 2025-06-03 Kyle B. Treleaven

The classical quasi-shuffle algebra for multiple zeta values have a well-known Hopf algebra structure. Recently, the shuffle algebra for multiple zeta values are also equipped with a Hopf algebra structure. This paper shows that these two…

Number Theory · Mathematics 2026-03-09 Li Guo , Hongyu Xiang , Bin Zhang

We construct a q-analogue of truncated version of symmetric multiple zeta values which satisfies the double shuffle relation. Using it, we define a q-analogue of symmetric multiple zeta values and see that it satisfies many of the same…

Number Theory · Mathematics 2023-06-28 Yoshihiro Takeyama

Site swap is a mathematical notation used by jugglers to communicate, create and study complex juggling patterns. Determining the number of possible site swap juggling patterns with respect to certain limiting parameters such as number of…

Combinatorics · Mathematics 2008-04-15 Carl Bracken

The scaling theory of irreversible aggregation is discussed in some detail. First, we review the general theory in the simplest case of binary reactions. We then extend consideration to ternary reactions, multispecies aggregation,…

Statistical Mechanics · Physics 2009-11-10 F. Leyvraz

Relation between dips of post-stack migrated and unmigrated data is well known and easy to derive. A similar relation between dips of pre-stack migrated and unmigrated constant offset data is not available in literature and is calculated…

Geophysics · Physics 2022-12-15 Jagmeet Singh

Let $(X,\mathcal{B},m,\tau)$ be a dynamical system with $\ds (X,\mathcal{B},m)$ a probability space and $\ds \tau$ an invertible, measure preserving transformation. The present paper deals with the almost everywhere convergence in…

Classical Analysis and ODEs · Mathematics 2011-04-19 Karin Reinhold , Anna Savvopoulou , Christopher Wedrychowicz

Commutativity has the same inherent limitations as compatibility. Then, it is worth conceiving simple concurrency control techniques. We propose a restricted form of commutativity which increases parallelism without incurring a higher…

Databases · Computer Science 2010-04-08 José Martinez , Carmelo Malta

We show that any permutation of ${1,2,...,N}$ can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place in parallel in time O(1). In the case where the…

Data Structures and Algorithms · Computer Science 2015-03-20 Qingxuan Yang , John Ellis , Khalegh Mamakani , Frank Ruskey

The Fisher-Yates shuffle is a well-known algorithm for shuffling a finite sequence, such that every permutation is equally likely. Despite its simplicity, it is prone to implementation errors that can introduce bias into the generated…

Cryptography and Security · Computer Science 2025-01-13 Stefan Zetzsche , Jean-Baptiste Tristan , Tancrede Lepoint , Mikael Mayer

We give a proof of double shuffle relations for $p$-adic multiple zeta values by developing higher dimensional version of tangential base points and discussing a relationship with two (and one) variable $p$-adic multiple polylogarithms.

Number Theory · Mathematics 2007-05-23 Amnon Besser , Hidekazu Furusho

Nonprobability (convenience) samples are increasingly sought to stabilize estimations for one or more population variables of interest that are performed using a randomized survey (reference) sample by increasing the effective sample size.…

We study skew product lifts and overlap numbers for equilibrium measures \mu_\psi of H\"older continuous potentials \psi on such lifts. We find computable formulas and estimates for the overlap numbers in several concrete significant cases…

Dynamical Systems · Mathematics 2018-08-07 Eugen Mihailescu

In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…

Artificial Intelligence · Computer Science 2010-12-30 Wan Ahmad Tajuddin Wan Abdullah

In this paper we improve the best known constant for the discrepancy formulated in the Komlos Conjecture. The result is based on the improvement of the subgaussian bound for the random vector constructed in the Gram-Schmidt Random Walk…

Probability · Mathematics 2024-04-09 Witold Bednorz , Piotr Godlewski

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali