Related papers: Coend calculus
In this paper, we present a series of mathematical problems which throw interesting lights on flamenco music. More specifically, these are problems in discrete and computational mathematics suggested by an analytical (not compositional)…
This is an indicatory presentation of main definitions and theorems of fibonomial calculus which is a special case of psi-extented rota's finite operator calculus.
Collaborative work and co-authorship are fundamental to the advancement of modern science. However, it is not clear how collaboration should be measured in achievement-based metrics. Co-author weighted credit introduces distortions into the…
We present some lambda calculus with explicit substitutions and named variables. The characteristic feature of this calculus is as follows: renaming of bound variables when performing substitutions is done using special reductions and may…
This version has been withdrawn. The new and final version is on ArXiv 1103.4878
We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their encodings are weakly bisimilar.
Rejoinder to ``Microarrays, Empirical Bayes and the Two-Groups Model'' [arXiv:0808.0572]
This book has four chapters. In the first chapter interval bistructures (biinterval structures) such as interval bisemigroup, interval bigroupoid, interval bigroup and interval biloops are introduced. Throughout this book we work only with…
This book contains a large number of exercises related to different stochastic disciplines. Difficulty of the problems varies from the basic level in the first chapter up to the analysis of articles in Probability, Statistics and Computer…
Rejoinder to ``Least angle regression'' by Efron et al. [math.ST/0406456]
Here I share a few notes I used in various course lectures, talks, etc. Some may be just calculations that in the textbooks are more complicated, scattered, or less specific; others may be simple observations I found useful or curious.
This article has been replaced by arXiv:0906.4031
In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…
A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offers a (co)algebraic framework for studying processes with algebraic branching structures and recursion operators. The framework captures Milner's algebra of regular…
This purpose of this book is twofold: to provide a general introduction to higher category theory (using the formalism of "quasicategories" or "weak Kan complexes"), and to apply this theory to the study of higher versions of Grothendieck…
Primitive recursion is a mature, well-understood topic in the theory and practice of programming. Yet its dual, primitive corecursion, is underappreciated and still seen as exotic. We aim to put them both on equal footing by giving a…
A compendium of thirty previously published open problems in computational geometry is presented.
The Curry-Howard Correspondence has a long history, and still is a topic of active research. Though there are extensive investigations into the subject, there doesn't seem to be a definitive formulation of this result in the level of…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
What is Sequence Algebra? This is a question that any teacher or student of mathematics or computer science can engage with. Sequences are in Calculus, Combinatorics, Statistics and Computation. They are foundational, a step up from number…