中文
相关论文

相关论文: Hoeffding decompositions and two-colour urn sequen…

200 篇论文

Consider a (possibly infinite) exchangeable sequence X={X_n:1\leqn<N}, where N\in N\cup {\infty}, with values in a Borel space (A,A), and note X_n=(X_1,...,X_n). We say that X is Hoeffding decomposable if, for each n, every square…

概率论 · 数学 2007-05-23 Giovanni Peccati

We study Hoeffding decomposable exchangeable sequences with values in a finite set D. We provide a new combinatorial characterization of Hoeffding decomposability and use this result to show that, if the cardinality of D is strictly greater…

概率论 · 数学 2012-05-24 Omar El-Dakkak , Giovanni Peccati , Igor Prünster

In this paper we define countable-configuration of groups and prove that two Hopfian groups with the same set of countable-configurations are isomorphic and vice versa. We also study the countable paradoxical decomposition of groups. It is…

泛函分析 · 数学 2021-10-22 M. Meisami , A. Rejali , A. Yousofzadeh

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

交换代数 · 数学 2019-02-20 Joachim von zur Gathen

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

交换代数 · 数学 2010-08-31 Constantin-Nicolae Beli

We study elements of second order linear recurrence sequences $(G_n)_{n= 0}^{\infty}$ of polynomials in $\mathbb{C}[x]$ which are decomposable, i.e. representable as $G_n=g\circ h$ for some $g, h\in \mathbb{C}[x]$ satisfying…

数论 · 数学 2017-03-10 Clemens Fuchs , Christina Karolus , Dijana Kreso

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

代数几何 · 数学 2009-10-12 Arnaud Bodin

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

交换代数 · 数学 2014-02-26 Arnaud Bodin , Guillaume Chéze , Pierre Débes

We present a simple alternative viewpoint on Hodge-Newton indecomposability, illustrating its explanatory value through a uniform proof of a combinatorial identity arising from affine Deligne-Lusztig varieties with finite Coxeter part.

数论 · 数学 2026-03-10 Dong Gyu Lim

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…

数论 · 数学 2018-10-09 A. Deajim , L. El Fadil

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

交换代数 · 数学 2009-07-02 Joachim von zur Gathen

We provide simple examples of two-color exchangeable sequences $\xi=(\xi_1, \xi_2, \ldots, \xi_n)$ that are not exchangeable. This answers a question of Bladt and Shaiderman~\cite[Question 2.6]{bladt2019characterisation} for finite…

概率论 · 数学 2023-10-04 Raghavendra Tripathi

We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that…

组合数学 · 数学 2015-05-13 Kevin N. Vander Meulen , Adam Van Tuyl

We study finite state transduction of automatic and morphic sequences. Dekking proved that morphic sequences are closed under transduction and in particular morphic images. We present a simple proof of this fact, and use the construction in…

形式语言与自动机理论 · 计算机科学 2014-06-09 David Sprunger , William Tune , Jörg Endrullis , Lawrence S. Moss

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

度量几何 · 数学 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

The extended de Finetti theorem characterizes exchangeable infinite random sequences as conditionally i.i.d. and shows that the apparently weaker distributional symmetry of spreadability is equivalent to exchangeability. Our main result is…

算子代数 · 数学 2008-06-24 Claus Köstler

We study several exactly solvable Polya-Eggenberger urn models with a \emph{diminishing} character, namely, balls of a specified color, say $x$ are completely drawn after a finite number of draws. The main quantity of interest here is the…

组合数学 · 数学 2022-12-13 Hsien-Kuei Hwang , Markus Kuba , Alois Panholzer

A left and right noetherian semiperfect ring R is known to be indecomposable if and only if its factor by the second power of Jacobson radical is. This characterisation is used to study simple R-modules in terms of their Ext groups. It is…

环与代数 · 数学 2024-12-16 Dominik Krasula

Performing an additive decomposition of arbitrary functions of random elements is paramount for global sensitivity analysis and, therefore, the interpretation of black-box models. The well-known seminal work of Hoeffding characterized the…

‹ 上一页 1 2 3 10 下一页 ›