Results 11 to 20 of about 9,651 (149)
Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms
In the paper we introduce and study partitions of vectors in N p , as a natural extension of the classical partitions of integers. We show that these vector partitions are the suitable combinatorial notion in extending the Faa di Bruno formula to a ...
F. Turcu, C. Bonchis, M. Najim
semanticscholar +3 more sources
Yun-Hu Wang, Yong Chen
semanticscholar +3 more sources
On generic and maximal k-ranks of binary forms [PDF]
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k in any number
Lundqvist, Samuel +3 more
core +2 more sources
In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial coefficients ...
Shirokov, D. S.
core +1 more source
Prior treatments of space-time communications in Rayleigh flat fading generally assume that channel coding covers either one fading interval-in which case there is a nonzero “outage capacity”-or multiple fading intervals-in which case there is a nonzero ...
Hassibi, Babak +2 more
core +3 more sources
Gaussian Bounds for Noise Correlation of Functions [PDF]
In this paper we derive tight bounds on the expected value of products of {\em low influence} functions defined on correlated probability spaces. The proofs are based on extending Fourier theory to an arbitrary number of correlated probability spaces, on
A. Bonami +20 more
core +4 more sources
This article presents a simple but effective two-step analytical–numerical algorithm for solving multi-dimensional multi-term time-fractional equations.
Ji Lin +4 more
semanticscholar +1 more source
Wigner formula of rotation matrices and quantum walks [PDF]
Quantization of a random-walk model is performed by giving a qudit (a multi-component wave function) to a walker at site and by introducing a quantum coin, which is a matrix representation of a unitary transformation.
A. Ambainis +17 more
core +2 more sources
Nilpotent polynomials approach to four-qubit entanglement [PDF]
We apply the general formalism of nilpotent polynomials [Mandilara et al, Phys. Rev. A 74, 022331 (2006)] to the problem of pure-state multipartite entanglement classification in four qubits.
Aikaterini Mandilara +6 more
core +4 more sources
Dense stellar systems such as globular clusters, galactic nuclei and nuclear star clusters are ideal loci to study stellar dynamics due to the very high densities reached, usually a million times higher than in the solar neighborhood; they are unique ...
Aarseth +107 more
core +1 more source

