Zobrazeno 1 - 10
of 40
pro vyhledávání: '"L. K. Lauderdale"'
Publikováno v:
Journal of Algebraic Combinatorics. 57:811-828
The Gelfand representation of $\mathcal{S}_n$ is the multiplicity-free direct sum of the irreducible representations of $\mathcal{S}_n$. In this paper, we use a result of Adin, Postnikov, and Roichman to find a recursive generating function for the G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6185a6913d14d40b13eda7ca013fb1ea
https://doi.org/10.1007/s10801-022-01194-3
https://doi.org/10.1007/s10801-022-01194-3
Autor:
Lowell Abrams, L.-K. Lauderdale
Publikováno v:
Discrete Mathematics. 346:113320
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5009fbabc252f63c63f116ba53dbb15a
https://doi.org/10.1016/j.disc.2023.113320
https://doi.org/10.1016/j.disc.2023.113320
Autor:
Charles Schmidt, L.-K. Lauderdale, Kassie Archer, Phung T. Tran, Rebecca Darby, Asa Linson, Mariah K. Maxfield
Publikováno v:
Journal of Algebraic Combinatorics. 54:1-15
For the positive integer m, let $${\mathbb {Z}}_m$$ denote the cyclic group of order m. Vertex-minimal planar graphs with prescribed automorphism group $${\mathbb {Z}}_m$$ were first considered by Marusic. In particular, when m is odd he produced a v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e31017e5c8d60f626bc4c20bf489a3b
https://doi.org/10.1007/s10801-020-00964-1
https://doi.org/10.1007/s10801-020-00964-1
Autor:
L.-K. Lauderdale, Jay Zimmerman
Publikováno v:
Journal of Algebraic Combinatorics. 54:205-221
A graph whose full automorphism group is isomorphic to a finite group G is called a G-graph, and we let $$\alpha (G)$$ denote the minimal number of vertices among all G-graphs. The value of $$\alpha (G)$$ has been established for numerous infinite fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d075aba38eebb2c95e013ddaaf85883
https://doi.org/10.1007/s10801-020-00975-y
https://doi.org/10.1007/s10801-020-00975-y
Publikováno v:
Journal of Algebraic Combinatorics. 53:355-367
For a positive integer m, let $${\mathbb {Z}}_m$$ denote the cyclic group of order m. In this article, we discuss the orders of vertex-minimal planar graphs with prescribed automorphism group $${\mathbb {Z}}_m$$ . Previously, Marusic investigated the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::518366abca680b3607cfa7b8b6ddde94
https://doi.org/10.1007/s10801-019-00932-4
https://doi.org/10.1007/s10801-019-00932-4
Autor:
Christina Graves, L.-K. Lauderdale
Publikováno v:
Discrete Mathematics. 342:1378-1391
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f214bc58e09f36eec4b2bb52badc1237
https://doi.org/10.1016/j.disc.2018.12.028
https://doi.org/10.1016/j.disc.2018.12.028
Autor:
L.-K. Lauderdale
Publikováno v:
Journal of Group Theory. 18:535-551
For a finite group G, let m(G) denote the set of maximal subgroups of G and π(G) denote the set of primes which divide |G|. In [Arch. Math. 101 (2013), 9–15], it is proven that |m(G)| = |π(G)| when G is cyclic and if G is noncyclic |m(G)| ≥ |π
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cede2220c5807856f6bd75df505a9c5
https://doi.org/10.1515/jgth-2015-0001
https://doi.org/10.1515/jgth-2015-0001
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
L. K. Lauderdale
Publikováno v:
Archiv der Mathematik. 101:9-15
For a finite group G, let m(G) denote the set of maximal subgroups of G and π(G) denote the set of primes which divide |G|. When G is a cyclic group, an elementary calculation proves that |m(G)| = |π(G)|. In this paper, we prove lower bounds on |m(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40ef8949a9be1c1997e028bb1304186
https://doi.org/10.1007/s00013-013-0531-2
https://doi.org/10.1007/s00013-013-0531-2