Results 21 to 30 of about 1,828,404 (296)
A Low-Complexity Channel Estimation for OFDM Systems Based on CIR Length Adaptation
IEEE Access, 2022 This paper addresses an adaptive implementation of frequency-domain channel estimators for orthogonal frequency-division multiplexing (OFDM) systems to reduce computational complexity.
Hyung-Rae Park
doaj +1 more source
Irreducible complexity of iterated symmetric bimodal maps
Discrete Dynamics in Nature and Society, 2005 We introduce a tree structure for the iterates of symmetric bimodal maps and identify a subset which we prove to be isomorphic to the family of unimodal maps.
J. P. Lampreia +2 more
doaj +1 more source
The complexity of computing Kronecker coefficients [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group $S_n$. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur ...
Peter Bürgisser, Christian Ikenmeyer
doaj +1 more source
On irreducible description of complex systems
Complexity, 2008 AbstractThe aim of the article is to present the description of complex systems in terms of self‐organization processes of prime integer relations and illustrate its main properties. Based on the integers and controlled by arithmetic only, the processes can characterize complex systems by information not requiring further simplification.
Korotkikh, Victor. +1 more
openaire +2 more sources
Irreducible divisor simplicial complexes [PDF]
Involve, a Journal of Mathematics, 2013 For an integral domain [math] , the irreducible divisor graph [math] of a nonunit [math] gives a visual representation of the factorizations of [math] . Here we consider a higher-dimensional generalization of this notion, the irreducible divisor simplicial complex [math] .
Baeth, Nicholas, Hobson, John
openaire +2 more sources
Irreducible morphisms of categories of complexes
Journal of Algebra, 2009 The authors investigate irreducible morphisms in some categories \(C_{\mathcal J}^I(\mathcal P)\) of complexes associated with a Krull-Schmidt subcategory \(\mathcal P\) of an additive category \(\mathcal A\). They define five classes of morphisms in \(C_{\mathcal J}^I(\mathcal P)\): \(pm_l,pe_l,im,ie,nsp\) and called these morphisms almost irreducible.
Giraldo, Hernán, Merklen, Héctor
openaire +2 more sources
Stanley's character polynomials and coloured factorisations in the symmetric group [PDF]
, 2007 In Stanley [R.P. Stanley, Irreducible symmetric group characters of rectangular shape, Sém. Lothar. Combin. 50 (2003) B50d, 11 p.] the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of ...
Rattan, Amarpreet
core +1 more source
Normalisers of irreducible subfactors [PDF]
, 2009 We consider normalizers of an infinite index irreducible inclusion Nsubset of or equal toM of II1 factors. Unlike the finite index setting, an inclusion uNu*subset of or equal toN can be strict, forcing us to also investigate the semigroup of one-sided ...
White, S., Wiggins, A., Smith, R.
core +1 more source
AKILLI TASARIM HAREKETİ YENİ BİR ŞEY SUNUYOR MU?
Felsefe Dünyası, 2021 Akıllı tasarım argümanı oldukça eski bir argüman. Ancak argümanın politik içerimleri de olan felsefi-teolojik bir harekete dönüşmesi son birkaç on yılda gerçekleşti.
Ferhat Onur
doaj
A Novel Technique for Solving Fully Fuzzy Nonlinear Systems Based on Neural Networks [PDF]
Vietnam Journal of Computer Science, 2020 Predicting the solutions of complex systems is a crucial challenge. Complexity exists because of the uncertainty as well as nonlinearity. The nonlinearity in complex systems makes uncertainty irreducible in several cases.
Raheleh Jafari +2 more
doaj +1 more source