Sciweavers

6833 search results - page 227 / 1367
» Some two-character sets
Sort
View
MOR
2007
138views more  MOR 2007»
15 years 6 months ago
The Demand-Matching Problem
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
F. Bruce Shepherd, Adrian Vetta
DMTCS
2008
80views Mathematics» more  DMTCS 2008»
15 years 5 months ago
Counting Descents, Rises, and Levels, with Prescribed First Element, in Words
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...
Sergey Kitaev, Toufik Mansour, Jeffrey B. Remmel
JAT
2010
39views more  JAT 2010»
15 years 5 months ago
On spectral polynomials of the Heun equation. I
The classical Heun equation has the form  Q(z) d2 dz2 + P (z) d dz + V (z) ff S(z) = 0, where Q(z) is a cubic complex polynomial, P (z) is a polynomial of degree at most 2 and ...
Boris Shapiro, Milos Tater
ORDER
2010
110views more  ORDER 2010»
15 years 5 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 5 months ago
Generating Bijections between HOAS and the Natural Numbers
ly correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have ...
John Tang Boyland