Results 11 to 20 of about 494,508 (266)
A Formula for the Partition Function That “Counts” [PDF]
Annals of Combinatorics, 2016 17 ...
Choliy, Yuriy, Sills, Andrew V.
openaire +3 more sources
Counting Defective Parking Functions [PDF]
The Electronic Journal of Combinatorics, 2008 Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with a larger number (if any). If all drivers park successfully, the sequence of choices is called a parking function.
Cameron, P. +3 more
openaire +5 more sources
Notre Dame Journal of Formal Logic, 1992 The proof by \textit{F. J. Pelletier} and \textit{N. M. Martin} [ibid. 31, 462- 475 (1990; Zbl 0745.03007)] of Post's Functional Completeness Theorem contains a very complex argument that shows in effect that counting functions are closed under composition. The purpose of this note is to give a simple proof of this result.
Johnson, Fred (Frederick A.), author +1 more
openaire +4 more sources
Counting with rational functions
Theoretical Computer Science, 1986 The authors characterize a special class of rational functions from a free monoid \(A^*\) into a cyclic free monoid \(t^*\). A semaphore is a subset H of \(A^*\) such that no word in H is a (connected) factor of another word in H. A partial function \(\alpha\) : \(A^*\to t^*\) is called a counting function if there exist \(n\geq 1\), rational ...
Christian Choffrut +1 more
openaire +3 more sources
On the counting function of semiprimes
, 2020 A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $π_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument, asymptotic series of $π_2(x)$ is determined, with all the terms explicitly given.
Crişan, D, Erban, R
openaire +4 more sources
On Counting Functions of Languages
Theoretical Computer Science, 2018 We study counting-regular languages—these are languages L for which there is a regular language \(L'\) such that the number of strings of length n in L and \(L'\) are the same for all n. Our main result is that the languages accepted by the class of one-way unambiguous, reversal-bounded pushdown automata (\(\textsf {PDA}\)’s) are counting-regular. This
Oscar H. Ibarra +2 more
openaire +6 more sources
Value distribution and the Lemma of the logarithmic derivative on polydiscs
International Journal of Mathematics and Mathematical Sciences, 1983 Value distribution is developed on polydiscs with the special emphasis that the value distribution function depend on a vector variable. A Lemma of the logarithmic derivative for meromorphic functions on polydiscs is derived. Here the Bergman boundary of
Wilhelm Stoll
doaj +1 more source
On the counting function for the 𝑎-values of a meromorphic function. [PDF]
Transactions of the American Mathematical Society, 1970 Introduction. If f(z) is a nonconstant meromorphic function in IzI
openaire +1 more source
Counting strings over $\mathbb{Z}2^d$ with Given Elementary Symmetric Function Evaluations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Let $\alpha$ be a string over $\mathbb{Z}_q$, where $q = 2^d$. The $j$-th elementary symmetric function evaluated at $\alpha$ is denoted $e_j(\alpha)$ . We study the cardinalities $S_q(m;\mathcal{T} _1,\mathcal{T} _2,\ldots,\mathcal{T} _t)$ of the set of
Charles Robert Miers, Franck Ruskey
doaj +1 more source
Logical definability of counting functions
Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kevin J. Compton, Erich Grädel
openaire +3 more sources