« first day (4257 days earlier)      last day (381 days later) » 

01:37
0
Q: Extending the Fundamental Theorem of Projective Geometry to projective lines over quadratic field extensions

wladIs there a theorem which characterises which bijective maps $f:\mathbb{GP}^1 \to \mathbb{GP}^1$, where $\mathbb{G:F}$ is a field extension of degree 2, have the property that whenever the cross ratio of four points of $\mathbb{GP}^1$, $(a,b;c,d)$, is in $\mathbb{FP}^1$, then the same is true for ...

In linear algebra, particularly projective geometry, a semilinear map between vector spaces V and W over a field K is a function that is a linear map "up to a twist", hence semi-linear, where "twist" means "field automorphism of K". Explicitly, it is a function T : V → W that is: additive with respect to vector addition: T ( v + v ′ ) = T ( v ) + T ( v ′ ) {\displaystyle T(v+v...
Nope. It's gone.
0
Q: Extending the Fundamental Theorem of Projective Geometry to projective lines over quadratic field extensions

wladIs there a theorem which characterises which bijective maps $f:\mathbb{GP}^1 \to \mathbb{GP}^1$, where $\mathbb{G:F}$ is a field extension of degree 2, have the property that whenever the cross ratio of four points of $\mathbb{GP}^1$, $(a,b;c,d)$, is in $\mathbb{FP}^1$, then the same is true for ...

In mathematics, incidence geometry is the study of incidence structures. A geometric structure such as the Euclidean plane is a complicated object that involves concepts such as length, angles, continuity, betweenness, and incidence. An incidence structure is what is obtained when all other concepts are removed and all that remains is the data about which points lie on which lines. Even with this severe limitation, theorems can be proved and interesting facts emerge concerning this structure. Such fundamental results remain valid when additional concepts are added to form a richer geometry. It...
0
Q: Free Commutative Monoid Quotient by Relations?

ChrisSay I have a commutative monoid $M$ that is generated by three elements $A,B,C$, where I have that $A+C=2B$. I want to write this a free (does that even mean anything?) monoid $\mathbb N^3$ with generators $X$, $Y$, $Z$ quotiented out by some equivalence relation $\sim$ that yields $[X]+[Z]=2[Y]$...

@XanderHenderson Well, in a few hours, I guess. (What time the time-pruning script runs?)
@MartinSleziak Indeed.
109
Q: How can we get rid of misspelled and unused (or "zombie") tags?

MottiDuring the re-tagging of questions, tags sometimes become orphaned from existing questions. Are these zombie tags ever removed from the tags list? What if a tag is misspelled and needs to be removed? How do we get rid of it? Return to FAQ Index

109
A: How can we get rid of misspelled and unused (or "zombie") tags?

Joel CoehoornYou should edit out the tag from all the questions that use it. Note that you should probably seek consensus on the per-site meta before doing so, if the tag was somehow added to a significant number of questions without anyone noticing the misspelling. Tags not associated with any question are ...

According to that answer: "Tags not associated with any question are automatically destroyed at 03:00 UTC every day."
02:30
1
Q: Is there an easy way to calculate the subfactorial of a number?

CrSb0001For context, I have been trying to find the subfactorials of numbers lately and am currently stuck on evaluating $!5$. The subfactorial of a number is defined as$$\dfrac{\Gamma(n+1,-1)}e$$however can be represented in integral form as$$!n=\int_{-1}^\infty x^ne^{-(x+1)}dx=\dfrac1e\int_{-1}^\infty ...

2
Q: Continuity of Optimal Stopping Time as a Function of the Starting Point

qp212223Consider the time-homogeneous optimal stopping problem $$V(x) = \sup_{\tau} E(f(X_\tau^x))$$ where $X^x$ is a diffusion starting at the point $x \in \mathbb{R}$. Typically, optimal stopping problems have an associated optimal stopping time $$\tau(x) \equiv \inf \{t \ge 0 : X^x_t \in S\}$$ where $...

1
Q: Hilbert's curve and random walk

DesmosTutuAs the title say see the reference for the Hilbert's curve : Say a creature start at some point in the Hilbert curve and have as code a rational number less than one to go away . Moreover each point are indexed like : And We consider for a sufficient large number of iteration a random walk se...

0
Q: Equi-coercivitiy of functionals on a metric space

Guy FsoneDefinition: A family of functionals $\{F_n\}$ on a metric space $X$ is said to be equi-coercive if, for every $\alpha \in \mathbb{R}$, there is a compact set $K_\alpha$ of $X$ such that for all $n$ we have $$\{F_n \leq \alpha\} \subseteq K_\alpha.$$ Question: If $\{F_n\}$ is a family of equi-coer...

1
Q: Construction of Covering space by Galois correspondence

NopeWe know, If $X$ is path connected,locally pathconnected,semi locally simply connected then $X$ has a universal cover $\overline X$.Now, By Galois Correspondence for any subgroup $H$ of $π_{1}(X)$ we can find subcover $X_H$ of $\overline X$ such that $p_*(X_H)=H$. My Question is : If I know univer...

1
Q: Show $\mathrm{disc}(1,\alpha,\dots,\alpha^{d-1})=(-1)^{d(d-1)/2}N_{\mathbb Q(\alpha)/\mathbb Q}(f'(\alpha))$, with $d=[\mathbb Q(\alpha):\mathbb Q]$

RobinSuppose $K = \mathbb{Q}(\alpha)$ for some $\alpha$ algebraic, and let $f$ be the minimal polynomial of $\alpha$ over $\mathbb{Q}$. Say $d = [K:\mathbb{Q}]$. I want to show that $$\mathrm{disc}(1, \alpha, \alpha^2, \dots, \alpha^{d-1}) = (-1)^{d(d-1)/2} N_{K/\mathbb{Q}} (f'(\alpha)).$$ I'm trying...

0
Q: Extending the Fundamental Theorem of Projective Geometry to projective lines over quadratic field extensions

wladIs there a theorem which characterises which bijective maps $f:\mathbb{GP}^1 \to \mathbb{GP}^1$, where $\mathbb{G:F}$ is a field extension of degree 2, have the property that whenever the cross ratio of four points of $\mathbb{GP}^1$, $(a,b;c,d)$, is in $\mathbb{FP}^1$, then the same is true for ...

Nov 21, 2023 at 13:23, by Martin Sleziak
Removed tags (from the most recent ones): main, meta.
Nov 21, 2023 at 13:24, by Martin Sleziak
Created tags (from the most recent ones): main, meta.
 
2 hours later…
04:24
The tag is gone.
1
Q: Number of cycles in a certain graph

Daniel C.In a certain problem I am asked to find how many $4$-cycles are there in the graph $C_4 + K_9$, where $C_4,K_9$ are the $4$-cyclic graph and the complete graph of $9$ vertices, respectively. Here, the addition means that both graphs are connected by exactly and edge and nothing else. Here is my a...

 
5 hours later…
09:26
1
Q: Tag Info vs. Tag Wiki: be clear they are the same

Dan JacobsonHere the user has just edited a "Tag Info" item. They then read about a seemingly additional "Tag Wiki" that they might want to edit. As Tag Info and Tag Wiki are probably in fact referring to the same thing, the language on the page needs to be tightened up to avoid confusing users.

tag-wiki and tag-wiki-excerpt (what you called "tag info", often referred to as "usage guidance" or "tag excerpt") are not the same thing. The excerpt is the text you see when hovering over a tag or clicking on it. It has a limit of 500 characters and no formatting. The tag wiki can be much longer and formatted in markdown. You only see it when going to the tag info. For an example see the tag excerpt and tag wiki of tag-wiki. — Jeanot Zubler 2 hours ago
On a slightly ironic sidenote, tag-wiki-excerpt does not have a tag wiki, only an excerpt. — Jeanot Zubler 2 hours ago
 
2 hours later…
11:54
2
Q: Maximum of discretized Gaussian process

Roberto RastapopoulosConsider a stationary discrete Gaussian process $(X^{\lambda}_n)_{n\in\mathbb N}$ with mean function $m(x) = 0$ and covariance function $$k(n,m) = e^{-\lambda|m-n|}.$$ You can think of it as a discretization of the stationary Ornstein--Uhlenbeck process with drift coefficient $\lambda$. Fix $N \i...

Aug 13, 2023 at 7:29, by Martin Sleziak
Two new tags and . (The question has no other tags - only the two that were created in that question.)
Aug 22, 2023 at 5:31, by Martin Sleziak
The tags and are gone: https://math.stackexchange.com/posts/4752118/revisions
Questions where the tags sstaring with "gaussian-process" were added/removed (including the editors): data.stackexchange.com/math/query/1105163/… data.stackexchange.com/math/query/1038474/…
No deleted questions with a tag starging wit "gaussian-process": data.stackexchange.com/math/query/883845/…
In probability theory and statistics, a Gaussian process is a stochastic process (a collection of random variables indexed by time or space), such that every finite collection of those random variables has a multivariate normal distribution. The distribution of a Gaussian process is the joint distribution of all those (infinitely many) random variables, and as such, it is a distribution over functions with a continuous domain, e.g. time or space. The concept of Gaussian processes is named after Carl Friedrich Gauss because it is based on the notion of the Gaussian distribution (normal distribution...
 
3 hours later…
14:44
The tag is back. There is also a tag-excerpt and a tag-wiki with this text: "Any question related to the concept of Gamma-convergence. The Gamma-convergence embodies the notion of convergence of minimizers of functionals."
1
Q: Equi-mildly coercivness of the "Modica and Mortola Theorem"'s funcionals

Measure meThroughout this section $\Omega$ will be a fixed open bounded subset of $\mathbb{R}^n$ with Lipschitz countinuous boundary, and $W:\mathbb{R}\to [0 , +\infty )$ will be a fixed non-negative continuous functon with exactly two zeros $\alpha, \beta$ ($0< \alpha < \beta$). Definition Let $(F_j)$ be ...

0
Q: Equi-coercivity of functionals on a metric space

Guy FsoneDefinition: A family of functionals $\{F_n\}$ on a metric space $X$ is said to be equi-coercive if, for every $\alpha \in \mathbb{R}$, there is a compact set $K_\alpha$ of $X$ such that for all $n$ we have $$\{F_n \leq \alpha\} \subseteq K_\alpha.$$ Question: If $\{F_n\}$ is a family of equi-coer...

 
2 hours later…
16:46
Please do not create new tags without running it by the community, first: math.meta.stackexchange.com/q/35451 . — Xander Henderson ♦ 2 hours ago

« first day (4257 days earlier)      last day (381 days later) »