Results 11 to 20 of about 2,606,960 (274)
The topology of restricted partition posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{
Richard Ehrenborg, JiYoon Jung
doaj +1 more source
A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau.
Jeffrey Ferreira
doaj +1 more source
Transformation of propositional calculus statements into integer and mixed integer programs: An approach towards automatic reformulation [PDF]
, 1990 A systematic procedure for transforming a set of logical statements or logical conditions imposed on a model into an Integer Linear Progamming (ILP) formulation Mixed Integer Programming (MIP) formulation is presented. An ILP stated as a system of linear
Hadjiconstantinou, E
core +4 more sources
The minimum weight t-composition of an integer [PDF]
Journal of Mathematical Sciences, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cardoso, D. M., Cerdeira, J. O.
openaire +2 more sources
Science and Technology Indonesia, 2022 This paper aims to treat a study on the order of every element in the higher even, odd and prime order of group for composition. Infact, express order of a group and order of an element of a group in real numbers.
Md. Abdul Mannan +2 more
doaj +3 more sources
Integer Factorization with Compositional Distributed Representations
Neuro-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 +3 more sources
Composite Fermions and Integer Partitions
Journal 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 +2 more sources
Prime ideal on the end_Z (Z^n ) Ring
Al-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
Gap inequalities for non-convex mixed-integer quadratic programs [PDF]
, 2011 Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura +2 more
core +5 more sources
Compositions of integers and Fibonacci numbers
Communications 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