Related papers: Rejoinder
Comment on ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
We present three proofs of an observation of Ahmadi on the number of irreducible polynomials over $\text{GF}(2)$ with certain traces and cotraces, the most interesting of which uses an explicit natural bijection. We also present two proofs…
Lecture notes for an introductory course in elementary particles.
The results in the preceding comment are placed on a more general mathematical foundation.
A qualitative (and selective) discussion of current activities and problems in the field is given.
In this paper, we reproduce experimental results presented in our earlier work titled "In-processing User Constrained Dominant Sets for User-Oriented Fairness in Recommender Systems" that was presented in the proceeding of the 31st ACM…
This is the rejoinder for discussion of "Multinomial Inverse Regression for Text Analysis", Journal of the American Statistical Association 108, 2013.
The primary purpose of this paper is to provide a survey of properties, values, identities, and generalizations of the Rogers--Ramanujan continued fraction, which is closely related to the Rogers--Ramanujan identities. Many of these results…
We indicate a natural generalization of the concept of subgroup commutativity degree of a finite group and a list of open problems on these new concepts.
Efficiency in optimisation and search processes persists to be one of the challenges, which affects the performance and use of optimisation algorithms. Utilising a pool of operators instead of a single operator to handle move operations…
Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.
The object of this paper is to study relationship between successive coefficients of some subclasses of the class of univalent functions in the unit disk. the result obtained is sharp, and is used to provide a new, short proof of the…
We introduce the hydra continued fractions, as a generalization of the Rogers-Ramanujan continued fractions, and give a combinatorial interpretation in terms of shift-plethystic trees. We then show it is possible to express them as a…
This paper gives a bijective proof of Andrews' refinement of the Alladi-Schur theorem. Moreover, it demonstrates that the bijective framework introduced here can be used to reproduce and provide a bijective account of Andrews' recursive…
This letter is a comment on an article by T.C. Halsey and M.H. Jensen in Nature about using recurrence times as a reliable tool to estimate multifractal dimensions of strange attractors. Our aim is to emphasize that in the recent…
Some of the conclusions of an improved JWKB method by Eleuch H., Rostovtsev Y. V. and Scully M. O., EPL, 89 (2010) 50004 are clarified. The degree of approximation to exact solutions is quantitatively assessed. The improved JWKB method is…
Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus…
This paper have been withdraw by the autors, because of a too early submission.
We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials' $ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly,…
Bayesian methods are increasingly applied in these days in the theory and practice of statistics. Any Bayesian inference depends on a likelihood and a prior. Ideally one would like to elicit a prior from related sources of information or…