Timeline for Does this matrix norm inequality have interesting application in other areas of mathematics?
Current License: CC BY-SA 4.0
20 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Nov 5, 2023 at 9:06 | history | bounty ended | CommunityBot | ||
S Nov 5, 2023 at 9:06 | history | notice removed | CommunityBot | ||
Oct 30, 2023 at 20:09 | comment | added | Carlo Beenakker | @FedericoPoloni --- I asked on meta.mathoverflow.net/q/5778/11260 (this discussion is probably better suited for Meta than here) | |
Oct 30, 2023 at 16:00 | comment | added | Iosif Pinelis | @FedericoPoloni : I have never seen elsewhere that one can be affiliated with a thing (such as a paper), rather than with a group/organization of people; see e.g. thefreedictionary.com/affiliation | |
Oct 30, 2023 at 15:50 | comment | added | Federico Poloni | @IosifPinelis In my reading, "disclose your affiliation" means "disclose that you are the author", i.e., your affiliation with the paper. "Affiliation" here is used as a synonym of "association", and it doesn't mean "your university/employer". If you disagree, we can ask for a confirmation on meta.mo that this is the case. I hope the purpose is clearer with this reading. | |
Oct 30, 2023 at 15:17 | comment | added | Iosif Pinelis | @FedericoPoloni : I do not see there a rule saying that it is always necessary to mention that "you" are the author of a paper "you" mention in your message. I do see "you must disclose your affiliation" there, and frankly I do not understand the purpose of disclosing the affiliation by the author of the paper. | |
Oct 30, 2023 at 14:17 | comment | added | Federico Poloni | @Mostafa Just to clarify, let me note that it is always necessary to mention that you are the author of a paper you mention in your messages, by the rules in mathoverflow.net/help/promotion . Thanks for complying! | |
Oct 28, 2023 at 15:30 | comment | added | Federico Poloni | Thanks @Mostafa ! | |
Oct 28, 2023 at 13:50 | comment | added | Mostafa - Free Palestine | @FedericoPoloni The aim of this question is merely to find some connections and applications for this work for making it applicable for publishing in a high rank journal. | |
Oct 28, 2023 at 13:44 | history | edited | Mostafa - Free Palestine | CC BY-SA 4.0 |
added 2 characters in body
|
Oct 28, 2023 at 13:44 | comment | added | Mostafa - Free Palestine | @FedericoPoloni Yes, I'm the author. I didnt find this necessary to mention, but I made an edit to the question to respond your request | |
Oct 28, 2023 at 9:38 | comment | added | Carlo Beenakker | related: mathoverflow.net/q/349044/11260 | |
S Oct 28, 2023 at 7:57 | history | bounty started | Mostafa - Free Palestine | ||
S Oct 28, 2023 at 7:57 | history | notice added | Mostafa - Free Palestine | Canonical answer required | |
Oct 26, 2023 at 11:37 | comment | added | Nathaniel Johnston | The distance between a matrix and the closest diagonal matrix (usually measured in the trace norm in this context) comes up naturally in quantum information theory when trying to quantify "how coherent" a quantum state is. See arXiv:1551.01854, for example. | |
Oct 26, 2023 at 9:20 | comment | added | Mostafa - Free Palestine | @Oxonon Nice! So do you think the mentioned theorem above, may have some application in statistics? As I'm not an expert in this subject, could you please give some references? | |
Oct 25, 2023 at 22:02 | comment | added | Oxonon | The operator norm, since we would usually care about worst-case performance. | |
Oct 25, 2023 at 19:18 | comment | added | Mostafa - Free Palestine | @Oxonon Which norms are used to measure the distance of covariance matrices? | |
Oct 25, 2023 at 18:23 | comment | added | Oxonon | Statistics, and in particular diagonal approximations to covariance matrices. One might try to bound how much worse is a model based on the best diagonal matrix is than the full matrix model. But that's only if you consider statistics to be an area of mathematics ;). | |
Oct 25, 2023 at 10:29 | history | asked | Mostafa - Free Palestine | CC BY-SA 4.0 |