1 - 6 of 6
Number of results to display per page
Search Results
2. Deleuze, Adorno a kompozice hudební mnohosti
- Creator:
- Nesbitt, Nick
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Gilles Deleuze, Theodor W. Adorno, philosophy of music, multiplicity, and John Coltrane
- Language:
- Czech
- Description:
- Th is text, fi rst published in Deleuze and Music, edited by Ian Buchanan and Marcel Swiboda (Edinburgh: Edinburgh University Press, 2004), pp. 54–74, Nick Nesbitt compares Th eodor W. Adorno’s negative dialectical approach with Gilles Deleuze’s antidialectical approach to the question of multiplicity and diff erentiation within music. Nesbitt concludes with a consideration of the attempts made to address the problem in the work of important twentieth-century musicians, particularly that of John Coltrane. Th e Czech translation here is by Marta Martinová and Michal Jurza.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
3. Multi-faithful spanning trees of infinite graphs
- Creator:
- Polat, Norbert
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- infinite graph, end, end-faithful, spanning tree, and multiplicity
- Language:
- English
- Description:
- For an end $\tau $ and a tree $T$ of a graph $G$ we denote respectively by $m(\tau )$ and $m_{T}(\tau )$ the maximum numbers of pairwise disjoint rays of $G$ and $T$ belonging to $\tau $, and we define $\mathop {\mathrm tm}(\tau ) := \min \lbrace m_{T}(\tau )\: T \text{is} \text{a} \text{spanning} \text{tree} \text{of} G \rbrace $. In this paper we give partial answers—affirmative and negative ones—to the general problem of determining if, for a function $f$ mapping every end $\tau $ of $G$ to a cardinal $f(\tau )$ such that $\mathop {\mathrm tm}(\tau ) \le f(\tau ) \le m(\tau )$, there exists a spanning tree $T$ of $G$ such that $m_{T}(\tau ) = f(\tau )$ for every end $\tau $ of $G$.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
4. On multiplicities of simple subquotients in generalized Verma modules
- Creator:
- Khomenko, Alexandre and Mazorchuk, Volodymyr
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- simple Lie algebra, Verma module, and multiplicity
- Language:
- English
- Description:
- We reduce the problem on multiplicities of simple subquotients in an $\alpha $-stratified generalized Verma module to the analogous problem for classical Verma modules.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
5. On the Frobenius number of a modular Diophantine inequality
- Creator:
- Rosales, J. C. and Vasco, P.
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- numerical semigroup, Diophantine inequality, Frobenius number, and multiplicity
- Language:
- English
- Description:
- We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b ≤ x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
6. On the multiplicity of Laplacian eigenvalues of graphs
- Creator:
- Guo, Ji-Ming, Feng, Lin, and Zhang, Jiong-Ming
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Laplacian eigenvalue, multiplicity, tree, and characteristic polynomial
- Language:
- English
- Description:
- In this paper we investigate the effect on the multiplicity of Laplacian eigenvalues of two disjoint connected graphs when adding an edge between them. As an application of the result, the multiplicity of 1 as a Laplacian eigenvalue of trees is also considered.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public