中文
相关论文

相关论文: Carry Propagation in Multiplication by Constants

200 篇论文

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

数论 · 数学 2017-12-29 Aleksei S. Volostnov

In this work, we investigate an optimization problem over adapted couplings between pairs of real valued random variables, possibly describing random times. We relate those couplings to a specific class of causal transport plans between…

概率论 · 数学 2022-10-18 Rémi Lassalle

In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…

组合数学 · 数学 2019-10-09 Andrew J. Uzzell

For fixed $t = 2$ or $3$, we investigate the statistical properties of $\{Y_t(n)\}$, the sequence of random variables corresponding to the number of hook lengths divisible by $t$ among the partitions of $n$. We characterize the support of…

数论 · 数学 2022-11-15 Hannah Lang , Hamilton Wan , Nancy Xu

Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…

组合数学 · 数学 2014-09-17 Benjamin Chaffin , John P. Linderman , N. J. A. Sloane , Allan R. Wilks

Many machine learning applications require operating on a spatially distributed dataset. Despite technological advances, privacy considerations and communication constraints may prevent gathering the entire dataset in a central unit. In…

Inspired by a recent note of Zeilberger (arXiv:1110.4379), Alejandro Morales asked whether one can count alternating (i.e., up-down) permutations that contain the pattern 123 or 321 exactly once. In this note we answer the question in the…

组合数学 · 数学 2011-11-07 Joel Brewster Lewis

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…

组合数学 · 数学 2020-06-24 Jonathan Novak , Brendon Rhoades

For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…

统计理论 · 数学 2008-10-10 T. Royen

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

数论 · 数学 2020-05-20 Min Tang , Hongwei Xu

Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a search procedure ("branch and prune") and used at every node of…

人工智能 · 计算机科学 2014-01-17 Lucas Bordeaux , George Katsirelos , Nina Narodytska , Moshe Y. Vardi

A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…

数论 · 数学 2017-01-30 Benjamin V. Holt

We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.

组合数学 · 数学 2023-03-07 Nicholas Van Nimwegen

An integer adder for integers in the binary representation is one of the basic operations of any digital processor. For adding two integers of N bits each, the serial adder takes as many clock ticks. For achieving higher speeds, parallel…

硬件体系结构 · 计算机科学 2019-03-26 Duggirala Meher Krishna , Duggirala Ravi

Efficient computation of the optimal transport distance between two distributions serves as an algorithm subroutine that empowers various applications. This paper develops a scalable first-order optimization-based method that computes…

机器学习 · 计算机科学 2024-06-21 Gen Li , Yanxi Chen , Yu Huang , Yuejie Chi , H. Vincent Poor , Yuxin Chen

The single-file problem of N particles in one spatial dimension is analyzed, when each particle has a randomly distributed diffusion constant D sampled in a density $\rho(D)$. The averaged one-particle distributions of the edge particles…

统计力学 · 物理学 2009-10-31 Claude Aslangul

We suggest a new approach to Artin's constant that leads to its representation as an infinite sum divided by another infinite sum. The same approach works well for Stephens' constant and higher rank Artin's constants. The main results are…

数论 · 数学 2009-03-11 Ivan Cherednik

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

组合数学 · 数学 2018-04-03 Bart Litjens

We present a general formalism to describe continuous-variable (CV) quantum teleportation of discrete-variable (DV) states with gain tuning, taking into account experimental imperfections. Here the teleportation output is given by…

Let $G$ be a finitely generated group equipped with a symmetric generating $% k $-tuple $S$. Let $|\cdot|$ and $V$ be the associated word length and volume growth function. Let $\nu$ be a probability measure such that $% \nu(g)\simeq…

概率论 · 数学 2013-09-25 Laurent Saloff-Coste , Tianyi Zheng