Results 31 to 40 of about 17,873 (292)

Integer Factorization with Compositional Distributed Representations

open access: yesNeuro-Inspired Computational Elements Conference, 2022
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural networks and potentially implemented on parallel neuromorphic hardware.
Denis Kleyko   +7 more
openaire   +2 more sources

On the dimension of downsets of integer partitions and compositions [PDF]

open access: yesAustralas. J Comb., 2017
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of partitions, while the set of all partitions has infinite dimension, we show that every proper downset of partitions has
Michael Engen, Vincent Vatter
openaire   +3 more sources

On two inequalities for the composition of arithmetic functions [PDF]

open access: yes, 2012
A paper about two inequalities for the composition of arithmetic ...
József Sándor, Sandor, Jozsef
core   +1 more source

Prime ideal on the end_Z (Z^n ) Ring

open access: yesAl-Jabar, 2022
The set of all endomorphisms over -module  is a non-empty set denoted by . From  we can construct the ring of  over addition and composition function. The prime ideal is an ideal which satisfies the properties like the prime numbers.
Zakaria Bani Ikhtiyar   +2 more
doaj   +1 more source

Composite Fermions and Integer Partitions

open access: yesJournal of Combinatorial Theory, Series A, 2001
The authors prove the unimodality of integer partitions with at most \(a\) parts, all parts less than or equal to \(b\), that are required to contain either repeated or consecutive parts. The proof uses the KOH theorem [\textit{D. Zeilberger}, Am. Math. Mon. 96, No. 7, 590-602 (1989; Zbl 0726.05005)].
Arthur T. Benjamin   +3 more
openaire   +1 more source

Compositions of integers and Fibonacci numbers

open access: yesCommunications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2023
In this paper, we deal with the compositions of the integers. We present the decompositions for both the composition sets and the odd composition sets of the integers. Thus the decompositions provide us to have not only an alternative proof of some well known identies but also many new identities for Fibonacci numbers and Lucas numbers.
Busra AL, Mustafa ALKAN
openaire   +2 more sources

Probabilistic Analysis of CarlitzCompositions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2002
Using generating functions and limit theorems, we obtain a stochastic description of Carlitz compositions of large integer n (i.e. compositions two successive parts of which are different).
Guy Louchard, Helmut Prodinger
doaj   +2 more sources

Solving nonlinear optimization problems with bipolar fuzzy relational equation constraints

open access: yesJournal of Inequalities and Applications, 2016
This paper considers the problem of minimizing a nonlinear objective function subject to a system of bipolar fuzzy relational equations with max- T L $T_{L}$ composition, where T L $T_{L}$ is the Łukasiewicz triangular norm.
Jian Zhou   +3 more
doaj   +1 more source

The Distribution of Run Lengths in Integer Compositions [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2011
We find explicitly the generating function for the number of compositions of $n$ that avoid all words on a given list of forbidden subwords, in the case where the forbidden words are pairwise letter-disjoint. From this we get the gf for compositions of $n$ with no $k$ consecutive parts equal, as well as the number with $m$ parts and no consecutive $k ...
openaire   +2 more sources

Subnormal Weighted Shifts on Directed Trees and Composition Operators in L2-Spaces with Nondensely Defined Powers

open access: yesAbstract and Applied Analysis, 2014
It is shown that for every positive integer n there exists a subnormal weighted shift on a directed tree (with or without root) whose nth power is densely defined while its (n+1)th power is not. As a consequence, for every positive integer n there exists
Piotr Budzyński   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy