Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Representation theory
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
Open Mathematics
|
2012
|
tom 10
|
nr 3
927-941
EN
We study the representation theory of the solution space of the one-dimensional Schrödinger equation with singular potential V λ(x) = λx −2 as a representation of $\widetilde{SL(2,\mathbb{R})}$ . The subspace of solutions for which the action globalizes is constructed via nonstandard induction outside the semisimple category. By studying the subspace of K-finite vectors in this space, a distinguished family of potentials, parametrized by the triangular numbers is shown to generate a global representation of $\widetilde{SL(2,\mathbb{R})}$ ⋉ H 3, where H 3 is the three-dimensional Heisenberg group.
2
Content available remote

Logics for stable and unstable mereological relations

86%
Open Mathematics
|
2011
|
tom 9
|
nr 6
1354-1379
EN
In this paper we present logics about stable and unstable versions of several well-known relations from mereology: part-of, overlap and underlap. An intuitive semantics is given for the stable and unstable relations, describing them as dynamic counterparts of the base mereological relations. Stable relations are described as ones that always hold, while unstable relations hold sometimes. A set of first-order sentences is provided to serve as axioms for the stable and unstable relations, and representation theory is developed in similar fashion to Stone’s representation theory for distributive lattices. First-order predicate logic and modal logic are presented with semantics based on structures with stable and unstable mereological relations. Completeness theorems for these logics are proved, as well as decidability in the case of the modal logic, hereditary undecidability in the case of the first-order logic, and NP-completeness for the satisfiability problem of the quantifier-free fragment of the first-order logic.
3
Content available remote

Squared cycles in monomial relations algebras

86%
Open Mathematics
|
2006
|
tom 4
|
nr 2
250-259
EN
Let $$\mathbb{K}$$ be an algebraically closed field. Consider a finite dimensional monomial relations algebra $$\Lambda = {{\mathbb{K}\Gamma } \mathord{\left/ {\vphantom {{\mathbb{K}\Gamma } I}} \right. \kern-\nulldelimiterspace} I}$$ of finite global dimension, where Γ is a quiver and I an admissible ideal generated by a set of paths from the path algebra $$\mathbb{K}\Gamma $$ . There are many modules over Λ which may be represented graphically by a tree with respect to a top element, of which the indecomposable projectives are the most natural example. These trees possess branches which correspond to right subpaths of cycles in the quiver. A pattern in the syzygies of a specific factor module of the corresponding indecomposable projective module is found, allowing us to conclude that the square of any cycle must lie in the ideal I.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.