var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FZmFaZDQXbe4PQS9kb&noBootstrap=1&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FZmFaZDQXbe4PQS9kb&noBootstrap=1&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FZmFaZDQXbe4PQS9kb&noBootstrap=1&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Generic stabilizers for simple algebraic groups acting on orthogonal and symplectic Grassmannians.\n \n \n \n\n\n \n Rizzoli, A.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{rizzoli2023generic,\n      title={Generic stabilizers for simple algebraic groups acting on orthogonal and symplectic Grassmannians}, \n      author={Aluna Rizzoli},\n      year={2023},\n      eprint={2308.08214},\n      archivePrefix={arXiv},\n      primaryClass={math.GR}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Modules for algebraic groups with finitely many orbits on totally singular 2-spaces.\n \n \n \n \n\n\n \n Rizzoli, A.\n\n\n \n\n\n\n Journal of Algebra, 606: 104-169. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"ModulesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{Rizzoli2,\ntitle = {Modules for algebraic groups with finitely many orbits on totally singular 2-spaces},\njournal = {Journal of Algebra},\nvolume = {606},\npages = {104-169},\nyear = {2022},\nissn = {0021-8693},\ndoi = {https://doi.org/10.1016/j.jalgebra.2022.05.006},\nurl = {https://www.sciencedirect.com/science/article/pii/S0021869322002101},\nauthor = {Aluna Rizzoli},\nkeywords = {Algebraic groups, Representation theory, Group theory},\nabstract = {This is the author's second paper treating the double coset problem for classical groups. Let G be an algebraic group over an algebraically closed field K. The double coset problem consists of classifying the pairs H,J of closed connected subgroups of G with finitely many (H,J)-double cosets in G. The critical setup occurs when H is reductive and J is a parabolic subgroup. Assume that G is a classical group, H is simple and J is a maximal parabolic Pk, the stabilizer of a totally singular k-space. We show that if there are finitely many (H,Pk)-double cosets in G, then the triple (G,H,k) belongs to a finite list of candidates. Most of these candidates have k=1 or k=2. The case k=1 was solved in [23] and here we deal with k=2. We solve this case by determining all faithful irreducible self-dual H-modules V, such that H has finitely many orbits on totally singular 2-spaces of V.}\n}\n\n\n
\n
\n\n\n
\n This is the author's second paper treating the double coset problem for classical groups. Let G be an algebraic group over an algebraically closed field K. The double coset problem consists of classifying the pairs H,J of closed connected subgroups of G with finitely many (H,J)-double cosets in G. The critical setup occurs when H is reductive and J is a parabolic subgroup. Assume that G is a classical group, H is simple and J is a maximal parabolic Pk, the stabilizer of a totally singular k-space. We show that if there are finitely many (H,Pk)-double cosets in G, then the triple (G,H,k) belongs to a finite list of candidates. Most of these candidates have k=1 or k=2. The case k=1 was solved in [23] and here we deal with k=2. We solve this case by determining all faithful irreducible self-dual H-modules V, such that H has finitely many orbits on totally singular 2-spaces of V.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Finite singular orbit modules for algebraic groups.\n \n \n \n \n\n\n \n Rizzoli, A.\n\n\n \n\n\n\n Journal of Algebra, 570: 75 - 118. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"FinitePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{rizzoli,\ntitle = "Finite singular orbit modules for algebraic groups",\njournal = "Journal of Algebra",\nvolume = "570",\npages = "75 - 118",\nyear = "2021",\nissn = "0021-8693",\ndoi = "https://doi.org/10.1016/j.jalgebra.2020.11.006",\nurl = "http://www.sciencedirect.com/science/article/pii/S0021869320305688",\nauthor = "Aluna Rizzoli",\nkeywords = "Algebraic groups, Double coset problem, Rational modules",\nabstract = "Building on the classification of modules for algebraic groups with finitely many orbits on subspaces [9], we determine all faithful irreducible modules V for a connected simple algebraic group H, such that H≤SO(V) and H has finitely many orbits on singular 1-spaces of V. We do the same for H connected semisimple, and maximal among connected semisimple subgroups. This question is naturally connected with the problem of finding for which pairs of subgroups H,K of an algebraic group G there are finitely many (H,K)-double cosets. This paper provides a solution to the question when K is a maximal parabolic subgroup P1 of a classical group SOn, where P1 is the stabilizer of a singular 1-space. We find an interesting range of new examples, from a 5-dimensional module for A1 in characteristic p>5, to the spin module for B6 when p=2."\n}\n\n
\n
\n\n\n
\n Building on the classification of modules for algebraic groups with finitely many orbits on subspaces [9], we determine all faithful irreducible modules V for a connected simple algebraic group H, such that H≤SO(V) and H has finitely many orbits on singular 1-spaces of V. We do the same for H connected semisimple, and maximal among connected semisimple subgroups. This question is naturally connected with the problem of finding for which pairs of subgroups H,K of an algebraic group G there are finitely many (H,K)-double cosets. This paper provides a solution to the question when K is a maximal parabolic subgroup P1 of a classical group SOn, where P1 is the stabilizer of a singular 1-space. We find an interesting range of new examples, from a 5-dimensional module for A1 in characteristic p>5, to the spin module for B6 when p=2.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the average box dimensions of graphs of typical continuous functions.\n \n \n \n \n\n\n \n Adam-Day, B.; Ashcroft, C.; Olsen, L.; Pinzani, N.; Rizzoli, A.; and Rowe, J.\n\n\n \n\n\n\n Acta Mathematica Hungarica, 156(2): 263–302. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{box-dimension,\n\tAbstract = {Let X be a bounded subset of {\\$}{\\$}{\\{}{$\\backslash$}mathbb{\\{}R{\\}} \\^{}{\\{}d{\\}}{\\}}{\\$}{\\$}Rdand write {\\$}{\\$}{\\{}C{\\_}{\\{}{$\\backslash$}mathsf{\\{}u{\\}}{\\}}(X){\\}}{\\$}{\\$}Cu(X)for the set of uniformly continuous functions on X equipped with the uniform norm. The lower and upper box dimensions, denoted by {\\$}{\\$}{\\{}{$\\backslash$}underline{\\{}{$\\backslash$}rm dim{\\}}{\\_}{\\{}{$\\backslash$}mathsf{\\{}B{\\}}{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}}{\\$}{\\$}dim̲B(graph(f))and {\\$}{\\$}{\\{}{$\\backslash$}overline{\\{}{$\\backslash$}rm dim{\\}}{\\_}{\\{}{$\\backslash$}mathsf{\\{}B{\\}}{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}}{\\$}{\\$}dim¯B(graph(f)), of the graph {\\$}{\\$}{\\{}{$\\backslash$}rm graph(f){\\}}{\\$}{\\$}graph(f)of a function {\\$}{\\$}{\\{}f{$\\backslash$}in C{\\_}{\\{}{$\\backslash$}mathsf{\\{}u{\\}}{\\}}(X){\\}}{\\$}{\\$}f∈Cu(X)are defined by{\\$}{\\$}{$\\backslash$}begin{\\{}aligned{\\}}{\\{}{$\\backslash$}underline{\\{}{$\\backslash$}rm dim{\\}}{\\_}{\\{}{$\\backslash$}mathsf{\\{}B{\\}}{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}} = {\\{}{$\\backslash$}lim{\\_}{\\{}{$\\backslash$}delta {$\\backslash$}searrow 0{\\}} {\\{}{$\\backslash$}rm inf{\\}}{\\}} {\\{}{$\\backslash$}frac{\\{}{\\{}{$\\backslash$}rm log{\\}} N{\\_}{\\{}{$\\backslash$}delta{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}}{\\{}-{$\\backslash$}rm log {$\\backslash$}delta{\\}}{\\}},{$\\backslash$}{$\\backslash$}{\\{}{$\\backslash$}overline{\\{}{$\\backslash$}rm dim{\\}}{\\_}{\\{}{$\\backslash$}mathsf{\\{}B{\\}}{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}} = {\\{}{$\\backslash$}lim{\\_}{\\{}{$\\backslash$}delta {$\\backslash$}searrow 0{\\}} {\\{}{$\\backslash$}rm sup{\\}}{\\}} {\\{}{$\\backslash$}frac{\\{}{\\{}{$\\backslash$}rm log{\\}} N{\\_}{\\{}{$\\backslash$}delta{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}}{\\{}-{$\\backslash$}rm log {$\\backslash$}, {$\\backslash$}delta{\\}}{\\}},{$\\backslash$}end{\\{}aligned{\\}}{\\$}{\\$}dim̲B(graph(f))=limδ↘0inflogNδ(graph(f))-logδ,dim¯B(graph(f))=limδ↘0suplogNδ(graph(f))-logδ,where {\\$}{\\$}{\\{}N{\\_}{\\{}{$\\backslash$}delta{\\}}({\\{}{$\\backslash$}rm graph{\\}}(f)){\\}}{\\$}{\\$}Nδ(graph(f))denotes the number of δ-mesh cubes that intersect {\\$}{\\$}{\\{}{$\\backslash$}rm graph(f){\\}}{\\$}{\\$}graph(f).},\n\tAuthor = {Adam-Day, B. and Ashcroft, C. and Olsen, L. and Pinzani, N. and Rizzoli, A. and Rowe, J.},\n\tDa = {2018/12/01},\n\tDate-Added = {2021-01-09 16:55:29 +0000},\n\tDate-Modified = {2021-01-09 16:55:29 +0000},\n\tDoi = {10.1007/s10474-018-0871-2},\n\tId = {Adam-Day2018},\n\tIsbn = {1588-2632},\n\tJournal = {Acta Mathematica Hungarica},\n\tNumber = {2},\n\tPages = {263--302},\n\tTitle = {On the average box dimensions of graphs of typical continuous functions},\n\tTy = {JOUR},\n\tUrl = {https://doi.org/10.1007/s10474-018-0871-2},\n\tVolume = {156},\n\tYear = {2018},\n\tBdsk-Url-1 = {https://doi.org/10.1007/s10474-018-0871-2},\n\tBdsk-Url-2 = {http://dx.doi.org/10.1007/s10474-018-0871-2}}\n\n\n
\n
\n\n\n
\n Let X be a bounded subset of $}{$\\$\\$mathbb\\R\\ ^\\d\\\\$}{$Rdand write $}{$\\C_\\$\\$mathsf\\u\\\\(X)\\$}{$Cu(X)for the set of uniformly continuous functions on X equipped with the uniform norm. The lower and upper box dimensions, denoted by $}{$\\$\\$underline\\$\\$rm dim\\_\\$\\$mathsf\\B\\\\(\\$\\$rm graph\\(f))\\$}{$dim̲B(graph(f))and $}{$\\$\\$overline\\$\\$rm dim\\_\\$\\$mathsf\\B\\\\(\\$\\$rm graph\\(f))\\$}{$dim¯B(graph(f)), of the graph $}{$\\$\\$rm graph(f)\\$}{$graph(f)of a function $}{$\\f$\\$in C_\\$\\$mathsf\\u\\\\(X)\\$}{$f∈Cu(X)are defined by$}{$$\\$begin\\aligned\\\\$\\$underline\\$\\$rm dim\\_\\$\\$mathsf\\B\\\\(\\$\\$rm graph\\(f))\\ = \\$\\$lim_\\$\\$delta $\\$searrow 0\\ \\$\\$rm inf\\\\ \\$\\$frac\\\\$\\$rm log\\ N_\\$\\$delta\\(\\$\\$rm graph\\(f))\\\\-$\\$rm log $\\$delta\\\\,$\\$$\\$\\$\\$overline\\$\\$rm dim\\_\\$\\$mathsf\\B\\\\(\\$\\$rm graph\\(f))\\ = \\$\\$lim_\\$\\$delta $\\$searrow 0\\ \\$\\$rm sup\\\\ \\$\\$frac\\\\$\\$rm log\\ N_\\$\\$delta\\(\\$\\$rm graph\\(f))\\\\-$\\$rm log $\\$, $\\$delta\\\\,$\\$end\\aligned\\$}{$dim̲B(graph(f))=limδ↘0inflogNδ(graph(f))-logδ,dim¯B(graph(f))=limδ↘0suplogNδ(graph(f))-logδ,where $}{$\\N_\\$\\$delta\\(\\$\\$rm graph\\(f))\\$}{$Nδ(graph(f))denotes the number of δ-mesh cubes that intersect $}{$\\$\\$rm graph(f)\\$}{$graph(f).\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Interactive simulations for quantum key distribution.\n \n \n \n \n\n\n \n Kohnle, A.; and Rizzoli, A.\n\n\n \n\n\n\n European Journal of Physics, 38(3): 035403. mar 2017.\n \n\n\n\n
\n\n\n\n \n \n \"InteractivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{quantum,\n\tdoi = {10.1088/1361-6404/aa62c8},\n\turl = {https://doi.org/10.1088/1361-6404/aa62c8},\n\tyear = 2017,\n\tmonth = {mar},\n\tpublisher = {{IOP} Publishing},\n\tvolume = {38},\n\tnumber = {3},\n\tpages = {035403},\n\tauthor = {Antje Kohnle and Aluna Rizzoli},\n\ttitle = {Interactive simulations for quantum key distribution},\n\tjournal = {European Journal of Physics},\n\tabstract = {Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution (QKD) allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key that is only known to themselves. Classically, Alice and Bob could never be certain that their communication was not compromised by a malicious eavesdropper. Quantum mechanics however makes secure communication possible. The fundamental principle of quantum mechanics that taking a measurement perturbs the system (unless the measurement is compatible with the quantum state) also applies to an eavesdropper. Using appropriate protocols to create the key, Alice and Bob can detect the presence of an eavesdropper by errors in their measurements. As part of the QuVis Quantum Mechanics Visualisation Project, we have developed a suite of four interactive simulations that demonstrate the basic principles of three different QKD protocols. The simulations use either polarised photons or spin 1/2 particles as physical realisations. The simulations and accompanying activities are freely available for use online or download, and run on a wide range of devices including tablets and PCs. Evaluation with students over three years was used to refine the simulations and activities. Preliminary studies show that the refined simulations and activities help students learn the basic principles of QKD at both the introductory and advanced undergraduate levels.}\n}\n\n\n
\n
\n\n\n
\n Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution (QKD) allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key that is only known to themselves. Classically, Alice and Bob could never be certain that their communication was not compromised by a malicious eavesdropper. Quantum mechanics however makes secure communication possible. The fundamental principle of quantum mechanics that taking a measurement perturbs the system (unless the measurement is compatible with the quantum state) also applies to an eavesdropper. Using appropriate protocols to create the key, Alice and Bob can detect the presence of an eavesdropper by errors in their measurements. As part of the QuVis Quantum Mechanics Visualisation Project, we have developed a suite of four interactive simulations that demonstrate the basic principles of three different QKD protocols. The simulations use either polarised photons or spin 1/2 particles as physical realisations. The simulations and accompanying activities are freely available for use online or download, and run on a wide range of devices including tablets and PCs. Evaluation with students over three years was used to refine the simulations and activities. Preliminary studies show that the refined simulations and activities help students learn the basic principles of QKD at both the introductory and advanced undergraduate levels.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);