Elementary Symmetric functions of one variable












1












$begingroup$


Are all single valued functions, of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distinct $n$ variables.



Presumably as there is no variable to permute, any function of one variable is symmetric in this sense?
ie, $F(x)=F(x),text{where},,F(x)in mathbb{R}$.



Secondly, what about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the $k$th (first power sum of the one and only variable) so that $F(x)=x^k=x$ as $k=1$ ; ie does the permutation just mean, (in the one variable case), just swapping the 1st element of the domain with the first element of the domain (ie,itself), so that given the permutation, $F(x)=x$ ?, which is the original function value, and thus, $F$ is symmetric?.



I know that,that this is trivial if this is what is meant, so am just checking that I am, correct that permutation symmetry is not re-defined to mean something else, in the case of a single variable function, simply because there does not exist a distinct permutation of the domain elements, to begin with?



Ie, does a permutation, of an element of the domain, $x$ (or in general), have to be distinct,to count as a permutation of that $x$ ie is $langle x rangle$, considered, non-distinct, permutation of $langle xrangle$, formally?. That is, formally, is it acceptable to use the term, 'a permutation of $x$', in the case that where the permutation, simply returns '$x$', that is leaves the entity permuted, invariant. Which, incidentally, will always be the case for a one variable function, and thus will be symmetric as per my question . And am I correct, that this applies in general. For example,in cases where each element of the domain, is an ordered set of 2 or more elements of reals, that, it is still acceptable to call the identity transformation, of some element of the domain, a 'permutation', of that element of the domain?



ie $langle x,yrangle$, a 'permutation' of $langle x,yrangle$, despite the fact that it returns the very same ordered set, must a 'permutation' return a distinct ordering of the elements of that ordered set, for the term, 'permutation of that ordered set', to be correctly used?










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Yes, but the "symmetry" of symmetric functions of one variable has what use?
    $endgroup$
    – quasi
    May 4 '17 at 6:39












  • $begingroup$
    presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
    $endgroup$
    – William Balthes
    May 4 '17 at 7:17
















1












$begingroup$


Are all single valued functions, of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distinct $n$ variables.



Presumably as there is no variable to permute, any function of one variable is symmetric in this sense?
ie, $F(x)=F(x),text{where},,F(x)in mathbb{R}$.



Secondly, what about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the $k$th (first power sum of the one and only variable) so that $F(x)=x^k=x$ as $k=1$ ; ie does the permutation just mean, (in the one variable case), just swapping the 1st element of the domain with the first element of the domain (ie,itself), so that given the permutation, $F(x)=x$ ?, which is the original function value, and thus, $F$ is symmetric?.



I know that,that this is trivial if this is what is meant, so am just checking that I am, correct that permutation symmetry is not re-defined to mean something else, in the case of a single variable function, simply because there does not exist a distinct permutation of the domain elements, to begin with?



Ie, does a permutation, of an element of the domain, $x$ (or in general), have to be distinct,to count as a permutation of that $x$ ie is $langle x rangle$, considered, non-distinct, permutation of $langle xrangle$, formally?. That is, formally, is it acceptable to use the term, 'a permutation of $x$', in the case that where the permutation, simply returns '$x$', that is leaves the entity permuted, invariant. Which, incidentally, will always be the case for a one variable function, and thus will be symmetric as per my question . And am I correct, that this applies in general. For example,in cases where each element of the domain, is an ordered set of 2 or more elements of reals, that, it is still acceptable to call the identity transformation, of some element of the domain, a 'permutation', of that element of the domain?



ie $langle x,yrangle$, a 'permutation' of $langle x,yrangle$, despite the fact that it returns the very same ordered set, must a 'permutation' return a distinct ordering of the elements of that ordered set, for the term, 'permutation of that ordered set', to be correctly used?










share|cite|improve this question











$endgroup$








  • 2




    $begingroup$
    Yes, but the "symmetry" of symmetric functions of one variable has what use?
    $endgroup$
    – quasi
    May 4 '17 at 6:39












  • $begingroup$
    presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
    $endgroup$
    – William Balthes
    May 4 '17 at 7:17














1












1








1


2



$begingroup$


Are all single valued functions, of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distinct $n$ variables.



Presumably as there is no variable to permute, any function of one variable is symmetric in this sense?
ie, $F(x)=F(x),text{where},,F(x)in mathbb{R}$.



Secondly, what about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the $k$th (first power sum of the one and only variable) so that $F(x)=x^k=x$ as $k=1$ ; ie does the permutation just mean, (in the one variable case), just swapping the 1st element of the domain with the first element of the domain (ie,itself), so that given the permutation, $F(x)=x$ ?, which is the original function value, and thus, $F$ is symmetric?.



I know that,that this is trivial if this is what is meant, so am just checking that I am, correct that permutation symmetry is not re-defined to mean something else, in the case of a single variable function, simply because there does not exist a distinct permutation of the domain elements, to begin with?



Ie, does a permutation, of an element of the domain, $x$ (or in general), have to be distinct,to count as a permutation of that $x$ ie is $langle x rangle$, considered, non-distinct, permutation of $langle xrangle$, formally?. That is, formally, is it acceptable to use the term, 'a permutation of $x$', in the case that where the permutation, simply returns '$x$', that is leaves the entity permuted, invariant. Which, incidentally, will always be the case for a one variable function, and thus will be symmetric as per my question . And am I correct, that this applies in general. For example,in cases where each element of the domain, is an ordered set of 2 or more elements of reals, that, it is still acceptable to call the identity transformation, of some element of the domain, a 'permutation', of that element of the domain?



ie $langle x,yrangle$, a 'permutation' of $langle x,yrangle$, despite the fact that it returns the very same ordered set, must a 'permutation' return a distinct ordering of the elements of that ordered set, for the term, 'permutation of that ordered set', to be correctly used?










share|cite|improve this question











$endgroup$




Are all single valued functions, of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distinct $n$ variables.



Presumably as there is no variable to permute, any function of one variable is symmetric in this sense?
ie, $F(x)=F(x),text{where},,F(x)in mathbb{R}$.



Secondly, what about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the $k$th (first power sum of the one and only variable) so that $F(x)=x^k=x$ as $k=1$ ; ie does the permutation just mean, (in the one variable case), just swapping the 1st element of the domain with the first element of the domain (ie,itself), so that given the permutation, $F(x)=x$ ?, which is the original function value, and thus, $F$ is symmetric?.



I know that,that this is trivial if this is what is meant, so am just checking that I am, correct that permutation symmetry is not re-defined to mean something else, in the case of a single variable function, simply because there does not exist a distinct permutation of the domain elements, to begin with?



Ie, does a permutation, of an element of the domain, $x$ (or in general), have to be distinct,to count as a permutation of that $x$ ie is $langle x rangle$, considered, non-distinct, permutation of $langle xrangle$, formally?. That is, formally, is it acceptable to use the term, 'a permutation of $x$', in the case that where the permutation, simply returns '$x$', that is leaves the entity permuted, invariant. Which, incidentally, will always be the case for a one variable function, and thus will be symmetric as per my question . And am I correct, that this applies in general. For example,in cases where each element of the domain, is an ordered set of 2 or more elements of reals, that, it is still acceptable to call the identity transformation, of some element of the domain, a 'permutation', of that element of the domain?



ie $langle x,yrangle$, a 'permutation' of $langle x,yrangle$, despite the fact that it returns the very same ordered set, must a 'permutation' return a distinct ordering of the elements of that ordered set, for the term, 'permutation of that ordered set', to be correctly used?







functional-analysis functional-equations symmetry symmetric-polynomials symmetric-functions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 28 '18 at 10:40









the_fox

2,57711432




2,57711432










asked May 4 '17 at 6:37









William BalthesWilliam Balthes

3631415




3631415








  • 2




    $begingroup$
    Yes, but the "symmetry" of symmetric functions of one variable has what use?
    $endgroup$
    – quasi
    May 4 '17 at 6:39












  • $begingroup$
    presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
    $endgroup$
    – William Balthes
    May 4 '17 at 7:17














  • 2




    $begingroup$
    Yes, but the "symmetry" of symmetric functions of one variable has what use?
    $endgroup$
    – quasi
    May 4 '17 at 6:39












  • $begingroup$
    presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
    $endgroup$
    – William Balthes
    May 4 '17 at 7:17








2




2




$begingroup$
Yes, but the "symmetry" of symmetric functions of one variable has what use?
$endgroup$
– quasi
May 4 '17 at 6:39






$begingroup$
Yes, but the "symmetry" of symmetric functions of one variable has what use?
$endgroup$
– quasi
May 4 '17 at 6:39














$begingroup$
presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
$endgroup$
– William Balthes
May 4 '17 at 7:17




$begingroup$
presm-ably none? I think that was the point of my question. I presume that by the elementary symmetric functions that of one variable; it is meant the identity linear function F(x). I dont know if this is necessarily a good definition of symmetry in general. Should be call permutation symmetry I sppose
$endgroup$
– William Balthes
May 4 '17 at 7:17










1 Answer
1






active

oldest

votes


















1












$begingroup$


Are all functions of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distint n variables.




This is true for $n=1$ but not for $n>1$. For example, $f(x,y)=x$ is not a symmetric function of two variables $x$ and $y$.




Secondly What about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the kth (first power sum of the one and only variable) so that F(x)=x^k=x as k=1 ; ie does this denote F(x)=x




If you're trying to ask if $x$ is the only elementary symmetric polynomial of degree one in one variable (namely $x$), then yes.



One reason it could be useful to include functions of one variable in the class of symmetric polynomials - besides the fact that they obviously are, albeit a degenerate case - is as a base case in induction hypotheses or algorithms. One example is a constructive algorithm used in a proof of the fundamental theorem of symmetric polynomials.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:47










  • $begingroup$
    Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:48













Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2265167%2felementary-symmetric-functions-of-one-variable%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$


Are all functions of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distint n variables.




This is true for $n=1$ but not for $n>1$. For example, $f(x,y)=x$ is not a symmetric function of two variables $x$ and $y$.




Secondly What about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the kth (first power sum of the one and only variable) so that F(x)=x^k=x as k=1 ; ie does this denote F(x)=x




If you're trying to ask if $x$ is the only elementary symmetric polynomial of degree one in one variable (namely $x$), then yes.



One reason it could be useful to include functions of one variable in the class of symmetric polynomials - besides the fact that they obviously are, albeit a degenerate case - is as a base case in induction hypotheses or algorithms. One example is a constructive algorithm used in a proof of the fundamental theorem of symmetric polynomials.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:47










  • $begingroup$
    Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:48


















1












$begingroup$


Are all functions of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distint n variables.




This is true for $n=1$ but not for $n>1$. For example, $f(x,y)=x$ is not a symmetric function of two variables $x$ and $y$.




Secondly What about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the kth (first power sum of the one and only variable) so that F(x)=x^k=x as k=1 ; ie does this denote F(x)=x




If you're trying to ask if $x$ is the only elementary symmetric polynomial of degree one in one variable (namely $x$), then yes.



One reason it could be useful to include functions of one variable in the class of symmetric polynomials - besides the fact that they obviously are, albeit a degenerate case - is as a base case in induction hypotheses or algorithms. One example is a constructive algorithm used in a proof of the fundamental theorem of symmetric polynomials.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:47










  • $begingroup$
    Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:48
















1












1








1





$begingroup$


Are all functions of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distint n variables.




This is true for $n=1$ but not for $n>1$. For example, $f(x,y)=x$ is not a symmetric function of two variables $x$ and $y$.




Secondly What about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the kth (first power sum of the one and only variable) so that F(x)=x^k=x as k=1 ; ie does this denote F(x)=x




If you're trying to ask if $x$ is the only elementary symmetric polynomial of degree one in one variable (namely $x$), then yes.



One reason it could be useful to include functions of one variable in the class of symmetric polynomials - besides the fact that they obviously are, albeit a degenerate case - is as a base case in induction hypotheses or algorithms. One example is a constructive algorithm used in a proof of the fundamental theorem of symmetric polynomials.






share|cite|improve this answer









$endgroup$




Are all functions of one variable, symmetric. Where symmetric is taken to mean invariant under permutation of the distint n variables.




This is true for $n=1$ but not for $n>1$. For example, $f(x,y)=x$ is not a symmetric function of two variables $x$ and $y$.




Secondly What about the 1st degree, elementary symmetric functions of one variable. Is this just taken the the kth (first power sum of the one and only variable) so that F(x)=x^k=x as k=1 ; ie does this denote F(x)=x




If you're trying to ask if $x$ is the only elementary symmetric polynomial of degree one in one variable (namely $x$), then yes.



One reason it could be useful to include functions of one variable in the class of symmetric polynomials - besides the fact that they obviously are, albeit a degenerate case - is as a base case in induction hypotheses or algorithms. One example is a constructive algorithm used in a proof of the fundamental theorem of symmetric polynomials.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Jun 10 '17 at 23:08









songmorningsongmorning

1563




1563












  • $begingroup$
    What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:47










  • $begingroup$
    Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:48




















  • $begingroup$
    What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:47










  • $begingroup$
    Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
    $endgroup$
    – William Balthes
    Nov 28 '18 at 8:48


















$begingroup$
What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
$endgroup$
– William Balthes
Nov 28 '18 at 8:47




$begingroup$
What about when the function is not single valued, by which I do not mean a function that for every real in the domain, it returns a single set of reals, which is arguably sinle valued if its range is defined as a set ,of sets of 2 reals: $text{ranF(x)}=mathbb{R}timesmathbb{R}$. (ie, the function value at a point in the domain, is a 'single' set of 2 elements, not two inconsistent sets, nor both of the elements themselves, which would not be single valued (but then its range would be defined as the reals)
$endgroup$
– William Balthes
Nov 28 '18 at 8:47












$begingroup$
Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
$endgroup$
– William Balthes
Nov 28 '18 at 8:48






$begingroup$
Dear Songmorning, so long as the domain has more than one element of reals, its not just a single number ie: $text{dom(F)}=x,, |text{dom(F)}|=1$,so that, $F(x,y)=x land F(y,x)=y$, where, $y=x$. Apart from that case, ie, when there is more than one element in the domain, the function would be symmetric, though as there would be $(y,x)$ where $yneq x$
$endgroup$
– William Balthes
Nov 28 '18 at 8:48




















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2265167%2felementary-symmetric-functions-of-one-variable%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Plaza Victoria

In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...