Sciweavers

7796 search results - page 263 / 1560
» On Generalized Schur Numbers
Sort
View
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
15 years 6 months ago
A Closer Look at Lattice Points in Rational Simplices
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Matthias Beck
TC
2002
15 years 6 months ago
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
Zeljko Zilic, Zvonko G. Vranesic
MSOM
2008
103views more  MSOM 2008»
15 years 6 months ago
Facility Location with Stochastic Demand and Constraints on Waiting Time
We analyze the problem of optimal location of a set of facilities in the presence of stochastic demand and congestion. Customers travel to the closest facility to obtain service; ...
Opher Baron, Oded Berman, Dmitry Krass
JCT
2010
81views more  JCT 2010»
15 years 5 months ago
q-Partition algebra combinatorics
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector ...
Tom Halverson, Nathaniel Thiem
JCT
2010
87views more  JCT 2010»
15 years 5 months ago
Bijections between pattern-avoiding fillings of Young diagrams
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov’s work on positive Grassman cells. They are called Γ -diagrams, and are in bijection with decorate...
Matthieu Josuat-Vergès