Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
This tag is used if a reference is needed in a paper or textbook on a specific result.
2
votes
Accepted
What mathematical field work with this kind of concept?
I think you are looking for dynamical systems theory.
In particular (especially discrete) cases you might be interested in automata theory, modal logic and game theory. But your “definition” sounds m …
5
votes
Hausdorff measure on the sphere is well defined?
Let me describe a way to construct the desired measure directly giving uniformity, which is, in my opinion, much more elegant than using Riemannian geometry or the Hausdorff measure. It also gives a s …
3
votes
What are the best settings for the large scale geometry of locally compact groups?
Let me extend my comment above to give some more detailed information, especially regarding metrisability (I am not aware of any “theory: First of all it is well-known that a topological group is metr …
6
votes
2
answers
788
views
Plancherel formula for non-second-countable (non-unimodular) groups
The Plancherel formula for unimodular, second-countable, type 1 groups can be found in A Course in Abstract Harmonic Analysis by Gerald Folland (theorem 7.44) or here. It states that we can get a squa …
1
vote
Any grammar for the language $L =a^p$, $p$ is prime number of $\mathbb{N}$
There is a trival algorithm checking primality using linear space (on a Turing machine). Thus there is a context-sensitive grammar for this language. However, there is no context-free grammar by a pum …
2
votes
2
answers
291
views
Equivalence relations in suplattices
I am wondering about generalisations of the concept of equivalence relations to suplattices.
Here is my motivation: Given a set $X$. The powerset $\mathcal{P}(X)$ is a suplattice. For suplattices the …