Results 11 to 20 of about 258,537 (280)

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)].
Benjamin, Arthur T.   +3 more
openaire   +1 more source

Selective Categories and Linear Canonical Relations [PDF]

open access: yes, 2014
A construction of Wehrheim and Woodward circumvents the problem that compositions of smooth canonical relations are not always smooth, building a category suitable for functorial quantization.
Li-Bland, David, Weinstein, Alan
core   +4 more sources

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

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

QoS-Aware Middleware for Web Services Composition [PDF]

open access: yes, 2004
The paradigmatic shift from a Web of manual interactions to a Web of programmatic interactions driven by Web services is creating unprecedented opportunities for the formation of online Business-to-Business (B2B) collaborations.
Benatallah, Boualem   +5 more
core   +4 more sources

Discriminants of Chebyshev Radical Extensions [PDF]

open access: yes, 2013
Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of Phi.
Gassert, Thomas Alden
core   +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

Track Allocation in Freight-Train Classification with Mixed Tracks [PDF]

open access: yes, 2011
We consider the process of forming outbound trains from cars of inbound trains at rail-freight hump yards. Given the arrival and departure times as well as the composition of the trains, we study the problem of allocating classification tracks to ...
Bohlin, Markus   +3 more
core   +3 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

Approximation numbers of composition operators on $H^p$ spaces of Dirichlet series [PDF]

open access: yes, 2015
By a theorem of Bayart, $\varphi$ generates a bounded composition operator on the Hardy space $\Hp$of Dirichlet series ($1\le p1/2$ if $c_0=0$ and is either identically zero or maps the right half-plane into itself if $c_0$ is positive.
Bayart, Frédéric   +2 more
core   +3 more sources

Home - About - Disclaimer - Privacy