共查询到20条相似文献,搜索用时 0 毫秒
1.
In this paper, we investigate the expectation of the size of the largest table in an (α, θ)-Chinese restaurant process by
using and developing an idea originated in the work by Shepp, which discusses random permutation.
This work was supported by National Natural Science Foundation of China (Grant No. 10671036) and the National Basic Research
Program of China (Grant No. 2007CB814904) 相似文献
2.
A table algebra was defined in [1] in order to consider in a uniform way the common properties of conjugacy classes and irreducible
characters. Non-commutative table algebras were introduced in [5]. They generalize properties of such well-known objects as
coherent and Hecke algebras. Here we extend the main definition of a non-commutative table algebra by letting the ground field
be an integral domain. We call these algebrasgeneralized table algebras (GT-algebras, in brief). It is worth mentioning that this class of algebras includes generic Hecke-Iwahori algebras
of finite Coxeter groups. We develop the general theory for this type of algebras which includes their representation theory
and theory of closed subsets. We also study the properties of primitive integral table algebras.
This research was done at the Gelbart and Minerva Foundations through the Emmy Noether Research Institute for Mathematical
Science at Bar-Ilan University. The authors wish to thank these institutions for their support.
This author was partially supported by the Israeli Ministry of Absorption. 相似文献
3.
4.
We consider the operation of permuting in place the records of an open address hash table in order to correspond to a different hashing function. Our emphasis is primarily on minimizing the amount of work space used. Lower and upper bounds are derived on the unrestricted problem, that is, without making any assumptions about the probing discipline used. For the special case of linear probing, we give an algorithm which, in practice, requires no work space outside the table and which runs in linear time with respect to the table size. 相似文献
5.
6.
7.
Anwar H Joarder Walid S Al-Sabah 《International Journal of Mathematical Education in Science & Technology》2013,44(3):475-480
Conditional probability and statistical independence can be better explained with contingency tables. In this note some special cases of 2 X 2 contingency tables are considered. In turn an interesting insight into statistical dependence as well as independence of events is obtained. 相似文献
8.
10.
11.
12.
Martin H. Gutknecht 《Acta Appl Math》1993,33(2-3):165-194
We first review briefly the Newton-Padé approximation problem and the analogous problem with additional interpolation conditions at infinity, which we call multipoint Padé approximation problem. General recurrence formulas for the Newton-Padé table combine either two pairs of Newton-Padé forms or one such pair and a pair of multipoint Padé forms. We show that, likewise, certain general recurrences for the multipoint Padé table compose two pairs of multipoint Padé forms to get a new pair of multipoint Padé forms. We also discuss the possibility of superfast, i.e.,O(n log2
n) algorithms for certain rational interpolation problems. 相似文献
13.
J.A. Shanks 《Journal of Computational and Applied Mathematics》1984,11(3):343-351
Romberg-type extrapolation is commonly used in many areas of numerical computation. An algorithm is presented for forming the Romberg table for general step-length sequence and general powers in the asymptotic expansion. It is then shown that parameters of the algorithm can be used to gain an a priori bound on propagation of rounding errors in the table. 相似文献
14.
We solve the last missing case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Suppose we have two negotiating delegations with n=mk members each and we have a seating arrangement such that every day the negotiators sit at m tables with k people of the same delegation at one side of each table. Every person can effectively communicate just with three nearest persons across the table. Our goal is to guarantee that over the course of several days, every member of each delegation can communicate with every member of the other delegation exactly once. We denote by H(k, 3) the graph describing the communication at one table and by mH(k, 3) the graph consisting of m disjoint copies of H(k, 3). 相似文献
15.
Derick Wood 《BIT Numerical Mathematics》1973,13(2):245-246
A more realistic bound for the average number of comparisons needed to match an incoming identifier by table look-up, when the table is still growing, is derived.Work carried out under a National Research Council of Canada Grant No. A-7700. 相似文献
16.
Dalibor Froncek 《Discrete Mathematics》2009,309(2):501-389
We completely solve certain case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Let H(k,3) be a bipartite graph with bipartition X={x1,x2,…,xk},Y={y1,y2,…,yk} and edges x1y1,x1y2,xkyk−1,xkyk, and xiyi−1,xiyi,xiyi+1 for i=2,3,…,k−1. We completely characterize all complete bipartite graphs Kn,n that can be factorized into factors isomorphic to G=mH(k,3), where k is odd and mH(k,3) is the graph consisting of m disjoint copies of H(k,3). 相似文献
17.
In this paper we consider the incremental/decremental version of the edit distance problem: given a solution to the edit distance between two strings A and B, find a solution to the edit distance between A and B′ where B′=aB (incremental) or bB′=B (decremental). As a solution for the edit distance between A and B, we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem. 相似文献
18.
Stephen M. Stigler 《Mathematical Intelligencer》2005,27(1):83-85
Feel like writing a review for The Mathematical Intelligencer? You are welcome to submit an unsolicited review of a book of your choice; or, if you would welcome being assigned a book to review, please write us, telling us your expertise and your predilections. 相似文献
19.
The table placement problem consists in deciding how to seat the participants attending a social lunch or dinner so that the total social benefit of the event is maximum. Four different approaches are presented: a linear model, a bin-packing-based-approach, a quadratic assignment problem, and a greedy heuristic. The different formulations are computationally compared over a set of artificial instances and on the real data for the EURO Winter Institute 2007 Gala dinner. 相似文献
20.
Brian A. Hagler 《Linear algebra and its applications》2007,422(1):100-118
Definitions, theorems and examples are established for a general model of Laurent polynomial spaces and ordered orthogonal Laurent polynomial sequences, ordered with respect to ordered bases and orthogonal with respect to inner products ·=L°⊙ decomposed into transition functional ⊙ and strong moment functional, or, more generally, sample functional L couplings. Under this formulation that is shown to subsume those in the existing literature, new fundamental results are produced, including necessary and sufficient conditions for ordered OLPS to be sequences of nth numerators of continued fractions, in contrast to the classical result concerning nth denominators which is shown to hold only in special cases. 相似文献