✦ LIBER ✦

On lexicographic semi-commutations

✍ Scribed by Y. Métivier; E. Ochmanski

Book ID: 113162991
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 573 KB
Volume: 26
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90037-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-commutations

✍ M. Clerbout; M. Latteux 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 785 KB

On Confluent Semi-commutations: Decidabi

On Confluent Semi-commutations: Decidability and Complexity Results

✍ V. Diekert; E. Ochmanski; K. Reinhardt 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Central limit theorem for homogeneous pr

Central limit theorem for homogeneous processes with independent increments and Semi-Markov commutations

✍ V. S. Korolyuk; V. V. Korolyuk 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 264 KB

Semi-commutators of Toeplitz operators o

Semi-commutators of Toeplitz operators on the Bergman space

✍ Dechao Zheng 📂 Article 📅 1996 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 927 KB

On Multiflow Lexicographics

✍ Michael Lomonosov 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 251 KB

Given an undirected Eulerian network with the terminal-set {s} ∪ T , we call a vector ξ = (ξ(t) : t ∈ T ) feasible if there exists an integer maximum multiflow having exactly ξ(t) (s, t)-paths for each t ∈ T . This paper contributes to describing the set of feasible vectors. First, the feasible vec

Polynomial functions over commutative se

Polynomial functions over commutative semi-groups

✍ G. Kowol; H. Mitsch 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 560 KB