中文
相关论文

相关论文: Limiting distributions of conjugate algebraic inte…

200 篇论文

Given a compact subset $\Sigma$ of the real numbers obeying some technical conditions, we consider the set of algebraic integers whose conjugates all lie in $\Sigma$. The distribution of conjugates of such an integer defines a probability…

数论 · 数学 2024-03-19 Alexander Smith

Given a compact subset $\Sigma \subset \mathbb{R}$ (or $\mathbb{C}$) with logarithmic capacity greater than zero, we construct an explicit family of probability measures supported on $\Sigma$ such that their closure is all the possible weak…

数论 · 数学 2024-04-11 Naser Talebizadeh Sardari , Bryce Joseph Orloski

Given $X \subset R^n$, $\varepsilon \in (0,1)$, a parametrized family of probability distributions $(\mu\_{a})\_{a\in A}$ on $\Omega\subset R^p$, we consider the feasible set $X^*\_\varepsilon\subset X$ associated with the {\em…

最优化与控制 · 数学 2018-11-26 Jean Lasserre , Tillmann Weisser

Let $B$ be a finite, separable von Neumann algebra. We prove that a $B$-valued distribution $\mu$ that is the weak limit of an infinitesimal array is infinitely divisible. The proof of this theorem utilizes the Steinitz lemma and may be…

算子代数 · 数学 2011-11-08 John D. Williams

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

概率论 · 数学 2025-02-14 Axel Péneau

An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators…

计算机科学中的逻辑 · 计算机科学 2017-01-11 Andrew M Marshall , Catherine Meadows , Paliath Narendran

An infinite sequence $\alpha$ over an alphabet $\Sigma$ is $\mu$-distributed w.r.t. a probability map $\mu$ if, for every finite string $w$, the limiting frequency of $w$ in $\alpha$ exists and equals $\mu(w)$. %We raise the question of how…

形式语言与自动机理论 · 计算机科学 2022-11-16 Thomas Seiller , Jakob Grue Simonsen

Let $\mu$ be a probability measure on $\mathbb{Z}$ that is not a Dirac mass and that has finite support. We prove that if the coefficients of a monic polynomial $f(x)\in\mathbb{Z}[x]$ of degree $n$ are chosen independently at random…

数论 · 数学 2023-08-16 Lior Bary-Soroker , Dimitris Koukoulopoulos , Gady Kozma

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

计算复杂性 · 计算机科学 2015-02-24 Yash Deshpande , Andrea Montanari

Let $G$ be a bounded open subset of Euclidean space with real algebraic boundary $\Gamma$. Under the assumption that the degree $d$ of $\Gamma$ is given, and the power moments of the Lebesgue measure on $G$ are known up to order $3d$, we…

最优化与控制 · 数学 2014-02-07 Jean-Bernard Lasserre , Mihai Putinar

Given a compact metric space $X$ and a probability measure in the $\sigma-$algebra of Borel subsets of $X$, we will establish a dominated convergence theorem for ultralimits of sequences of integrable maps and apply it to deduce a…

动力系统 · 数学 2018-05-25 Maria Carvalho , Fernando Moreira

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

最优化与控制 · 数学 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

We derive a tight upper bound on the probability over $\mathbf{x}=(x_1,\dots,x_\mu) \in \mathbb{Z}^\mu$ uniformly distributed in $ [0,m)^\mu$ that $f(\mathbf{x}) = 0 \bmod N$ for any $\mu$-linear polynomial $f \in…

离散数学 · 计算机科学 2022-05-06 Benedikt Bünz , Ben Fisch

Let $\mu$ be a probability measure on $\mathbb C$, and let $P_n$ be the random polynomial whose zeros are sampled independently from $\mu$. We study the asymptotic distribution of zeros of high-order derivatives of $P_n$. We show that, for…

概率论 · 数学 2026-01-06 Jürgen Angst , Oanh Nguyen , Guillaume Poly

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…

概率论 · 数学 2025-04-21 Adrian Beker

We initiate a systematic investigation of distribution testing in the framework of algorithmic replicability. Specifically, given independent samples from a collection of probability distributions, the goal is to characterize the sample…

机器学习 · 计算机科学 2025-07-04 Ilias Diakonikolas , Jingyi Gao , Daniel Kane , Sihan Liu , Christopher Ye

Let $\lambda$ be a partition of the positive integer $n$, selected uniformly at random among all such partitions. Corteel et al. (1999) proposed three different procedures of sampling parts of $\lambda$ at random. They obtained limiting…

概率论 · 数学 2014-07-15 Ljuben Mutafchiev

We investigate the distribution of real algebraic numbers of a fixed degree having a close conjugate number, the distance between the conjugate numbers being given as a function of their height. The main result establishes the ubiquity of…

数论 · 数学 2010-09-13 Victor Beresnevich , Vasili Bernik , Friedrich Götze

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

数据结构与算法 · 计算机科学 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

机器学习 · 计算机科学 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal
‹ 上一页 1 2 3 10 下一页 ›