The references for Sage, sorted alphabetically by citation key.
REFERENCES:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
A
[ABBR2012] | A. Abad, R. Barrio, F. Blesa, M. Rodriguez. Algorithm 924. ACM
Transactions on Mathematical Software, 39 no. 1 (2012), 1-28. |
[ADKF1970] | V. Arlazarov, E. Dinic, M. Kronrod,
and I. Faradzev. ‘On Economical Construction of the
Transitive Closure of a Directed Graph.’
Dokl. Akad. Nauk. SSSR No. 194 (in Russian), English
Translation in Soviet Math Dokl. No. 11, 1970. |
[AHK2015] | Karim Adiprasito, June Huh, and Eric Katz. Hodge theory
for combinatorial geometries. Arxiv 1511.02888. |
[AHU1974] | A. Aho, J. Hopcroft, and J. Ullman. ‘Chapter 6: Matrix
Multiplication and Related Operations.’ The Design and
Analysis of Computer Algorithms. Addison-Wesley, 1974. |
[Aj1996] | M. Ajtai. Generating hard instances of lattice problems
(extended abstract). STOC, pp. 99–108, ACM, 1996. |
[AJL2011] | Susumu Ariki, Nicolas Jacon, and Cedric Lecouvey.
The modular branching rule for affine Hecke algebras of type A.
Adv. Math. 228:481-526 (2011). |
[Al1947] | A. A. Albert, A Structure Theory for Jordan
Algebras. Annals of Mathematics, Second Series, Vol. 48,
No. 3 (Jul., 1947), pp. 546–567. |
[AL1978] | A. O. L. Atkin and Wen-Ch’ing Winnie Li, Twists of
newforms and pseudo-eigenvalues of \(W\)-operators.
Inventiones math. 48 (1978), 221-243. |
[AL2015] | M. Aguiar and A. Lauve, The characteristic polynomial of
the Adams operators on graded connected Hopf
algebras. Algebra Number Theory, v.9, 2015, n.3, 2015. |
[AM1974] | J. F. Adams and H. R. Margolis, “Sub-Hopf-algebras of the
Steenrod algebra,” Proc. Cambridge Philos. Soc. 76 (1974),
45-52. |
[Ap1997] | T. Apostol, Modular functions and Dirichlet series in
number theory, Springer, 1997 (2nd ed), section 3.7–3.9. |
[APR2001] | George E. Andrews, Peter Paule, Axel Riese,
MacMahon’s partition analysis: the Omega package,
European J. Combin. 22 (2001), no. 7, 887–904. |
[Ar2006] | D. Armstrong. Generalized noncrossing partitions and
combinatorics of Coxeter groups. Mem. Amer. Math. Soc., 2006. |
[AR2012] | D. Armstrong and B. Rhoades. “The Shi arrangement and the
Ish arrangement”. Transactions of the American
Mathematical Society 364 (2012),
1509-1528. Arxiv 1009.1655 |
[AS1964] | M. Abramowitz and I. A. Stegun, Handbook of Mathematical
Functions, National Bureau of Standards Applied
Mathematics Series, 55. 1964. See also
http://www.math.sfu.ca/~cbm/aands/. |
[As2008] | Sami Assaf. A combinatorial realization of Schur-Weyl
duality via crystal graphs and dual equivalence
graphs. FPSAC 2008, 141-152, Discrete
Math. Theor. Comput. Sci. Proc., AJ, Assoc. Discrete
Math. Theor. Comput. Sci., (2008). Arxiv 0804.1587v1 |
[AS2011] | R.B.J.T Allenby and A. Slomson, “How to count”, CRC Press (2011) |
[ASD1971] | A. O. L. Atkin and H. P. F. Swinnerton-Dyer, “Modular
forms on noncongruence subgroups”, Proc. Symp. Pure
Math., Combinatorics (T. S. Motzkin, ed.), vol. 19, AMS,
Providence 1971 |
[Av2000] | D. Avis, A revised implementation of the reverse search
vertex enumeration algorithm. Polytopes-combinatorics and
computation. Birkhauser Basel, 2000. |
B
[Ba1994] | Kaushik Basu. The Traveler’s Dilemma: Paradoxes of
Rationality in Game Theory. The American Economic Review
(1994): 391-395. |
[Bar1970] | Barnette, “Diagrams and Schlegel diagrams”, in
Combinatorial Structures and Their Applications,
Proc. Calgary Internat. Conference 1969, New York, 1970,
Gordon and Breach. |
[BB1997] | Mladen Bestvina and Noel Brady. Morse theory and
finiteness properties of groups. Invent. Math. 129
(1997). No. 3,
445-470. www.math.ou.edu/~nbrady/papers/morse.ps. |
[BB2009] | Tomas J. Boothby and Robert W. Bradshaw. Bitslicing and
the Method of Four Russians Over Larger Finite
Fields. arXiv:0901.1413v1, 2009. Arxiv 0901.1413 |
[BBLSW1999] | Babson, Bjorner, Linusson, Shareshian, and Welker,
“Complexes of not i-connected graphs,” Topology 38
(1999), 271-299 |
[BBS1982] | L. Blum, M. Blum, and M. Shub. Comparison of Two
Pseudo-Random Number Generators. Advances in Cryptology:
Proceedings of Crypto ‘82, pp.61–78, 1982. |
[BBS1986] | L. Blum, M. Blum, and M. Shub. A Simple Unpredictable
Pseudo-Random Number Generator. SIAM Journal on
Computing, 15(2):364–383, 1986. |
[BC1977] | R. E. Bixby, W. H. Cunningham, Matroids, Graphs, and
3-Connectivity. In Graph theory and related topics
(Proc. Conf., Univ. Waterloo, Waterloo, ON, 1977), 91-103 |
[BC2003] | A. Biryukov and C. D. Canniere Block Ciphers and Systems
of Quadratic Equations; in Proceedings of Fast Software
Encryption 2003; LNCS 2887; pp. 274-289,
Springer-Verlag 2003. |
[BCCCNSY2010] | Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou
Cheng, Tung Chou, Ruben Niederhagen, Adi Shamir, and
Bo-Yin Yang. Fast exhaustive search for
polynomial systems in GF(2). In Stefan Mangard and
François-Xavier Standaert, editors, CHES, volume 6225
of Lecture Notes in Computer Science, pages
203–218. Springer, 2010. pre-print available at
http://eprint.iacr.org/2010/313.pdf |
[BDP2013] | Thomas Brüstle, Grégoire Dupont, Matthieu Pérotin
On Maximal Green Sequences
Arxiv 1205.2050 |
[Ber2008] | W. Bertram : Differential Geometry, Lie Groups and
Symmetric Spaces over General Base Fields and Rings,
Memoirs of the American Mathematical Society, vol. 192
(2008); doi:10.1090/memo/0900; Arxiv math/0502168 |
[BFZ2005] | A. Berenstein, S. Fomin, and A. Zelevinsky, Cluster
algebras. III. Upper bounds and double Bruhat cells,
Duke Math. J. 126 (2005), no. 1, 1–52. |
[BG1985] | M. Blum and S. Goldwasser. An Efficient Probabilistic
Public-Key Encryption Scheme Which Hides All Partial
Information. In Proceedings of CRYPTO 84 on Advances in
Cryptology, pp. 289–299, Springer, 1985. |
[BG1988] | M. Berger & B. Gostiaux : Differential Geometry:
Manifolds, Curves and Surfaces, Springer (New York)
(1988); doi:10.1007/978-1-4612-1033-7 |
[BH1994] | S. Billey, M. Haiman. Schubert polynomials for the
classical groups. J. Amer. Math. Soc., 1994. |
[BHS2008] | Robert Bradshaw, David Harvey and William
Stein. strassen_window_multiply_c. strassen.pyx, Sage
3.0, 2008. http://www.sagemath.org |
[Big1999] | Stephen J. Bigelow. The Burau representation is not
faithful for \(n = 5\). Geom. Topol., 3:397–404, 1999. |
[Big2003] | Stephen J. Bigelow, The Lawrence-Krammer representation,
Geometric Topology, 2001 Georgia International Topology
Conference, AMS/IP Studies in Advanced Mathematics 35
(2003). Arxiv math/0204057v1 |
[Bir1975] | J. Birman. Braids, Links, and Mapping Class Groups,
Princeton University Press, 1975 |
[BK1992] | U. Brehm and W. Kuhnel, “15-vertex triangulations of an
8-manifold”, Math. Annalen 294 (1992), no. 1, 167-193. |
[BK2001] | W. Bruns and R. Koch, Computing the integral closure of an
affine semigroup. Uni. Iaggelonicae Acta Math. 39, (2001),
59-70 |
[BL2000] | Anders Björner and Frank H. Lutz, “Simplicial manifolds,
bistellar flips and a 16-vertex triangulation of the
Poincaré homology 3-sphere”, Experiment. Math. 9 (2000),
no. 2, 275-289. |
[BL2008] | Corentin Boissy and Erwan Lanneau, “Dynamics and geometry
of the Rauzy-Veech induction for quadratic differentials”
(arxiv:0710.5614) to appear in Ergodic Theory and
Dynamical Systems. |
[BM1940] | Becker, M. F., and Saunders MacLane. The minimum number of
generators for inseparable algebraic extensions. Bulletin of the
American Mathematical Society 46, no. 2 (1940): 182-186. |
[BM2008] | John Adrian Bondy and U.S.R. Murty, “Graph theory”, Volume
244 of Graduate Texts in Mathematics, 2nd edition, Springer, 2008. |
[BM2003] | Bazzi and Mitter, {it Some constructions of codes from
group actions}, (preprint March 2003, available on
Mitter’s MIT website). |
[BN2008] | Victor V. Batyrev and Benjamin Nill. Combinatorial aspects
of mirror symmetry. In Integer points in polyhedra —
geometry, number theory, representation theory, algebra,
optimization, statistics, volume 452 of Contemp. Math.,
pages 35–66. Amer. Math. Soc., Providence,
RI, 2008. arXiv:math/0703456v2 [math.CO]. |
[Bo2009] | Bosch, S., Algebra, Springer 2009 |
[BP1982] | H. Beker and F. Piper. Cipher Systems: The Protection of
Communications. John Wiley and Sons, 1982. |
[BP2000] | V. M. Bukhshtaber and T. E. Panov, “Moment-angle
complexes and combinatorics of simplicial manifolds,”
Uspekhi Mat. Nauk 55 (2000), 171–172. |
[BP2015] | P. Butera and M. Pernici “Sums of permanental minors
using Grassmann algebra”, International Journal of Graph
Theory and its Applications, 1 (2015),
83–96. Arxiv 1406.5337 |
[BPRS2009] | J. Bastian, T. Prellberg, M. Rubey, C. Stump, Counting the
number of elements in the mutation classes of `tilde{A}_n`-quivers,
Arxiv 0906.0487 |
[Br1910] | Bruckner, “Uber die Ableitung der allgemeinen Polytope und
die nach Isomorphismus verschiedenen Typen der allgemeinen
Achtzelle (Oktatope)”, Verhand. Konik. Akad. Wetenschap,
Erste Sectie, 10 (1910) |
[BS1996] | Eric Bach, Jeffrey Shallit. Algorithmic Number Theory,
Vol. 1: Efficient Algorithms. MIT Press, 1996. ISBN
978-0262024051. |
[BSS2009] | David Bremner, Mathieu Dutour Sikiric, Achill Schuermann:
Polyhedral representation conversion up to symmetries,
Proceedings of the 2006 CRM workshop on polyhedral
computation, AMS/CRM Lecture Notes, 48 (2009),
45-71. http://arxiv.org/abs/math/0702239 |
[BSV2010] | M. Bolt, S. Snoeyink, E. Van Andel. “Visual
representation of the Riemann map and Ahlfors map via the
Kerzman-Stein equation”. Involve 3-4 (2010), 405-420. |
[BW1996] | Anders Bjorner and Michelle L. Wachs. Shellable nonpure
complexes and posets. I. Trans. of
Amer. Math. Soc. 348 No. 4. (1996) |
[BZ01] | A. Berenstein, A. Zelevinsky
Tensor product multiplicities, canonical bases
and totally positive varieties
Invent. Math. 143 No. 1. (2002), 77-128. |
C
[CB2007] | Nicolas Courtois, Gregory V. Bard: Algebraic Cryptanalysis
of the Data Encryption Standard, In 11-th IMA Conference,
Cirencester, UK, 18-20 December 2007, Springer
LNCS 4887. See also http://eprint.iacr.org/2006/402/. |
[CDL2015] | A. Canteaut, Sebastien Duval, Gaetan Leurent
Construction of Lightweight S-Boxes using Feistel and
MISTY Structures; in Proceedings of SAC 2015; LNCS 9566;
pp. 373-393; Springer-Verlag 2015; available at
http://eprint.iacr.org/2015/711.pdf |
[CEW2011] | Georgios Chalkiadakis, Edith Elkind, and Michael
Wooldridge. Computational Aspects of Cooperative Game
Theory. Morgan & Claypool Publishers, (2011). ISBN
9781608456529, doi:10.2200/S00355ED1V01Y201107AIM016. |
[CGW2013] | Daniel Cabarcas, Florian Göpfert, and Patrick
Weiden. Provably Secure LWE-Encryption with Uniform
Secret. Cryptology ePrint Archive, Report 2013/164. 2013.
2013/164. http://eprint.iacr.org/2013/164 |
[CGMRV16] | A. Conte, R. Grossi, A. Marino, R. Rizzi, L. Versari,
“Directing Road Networks by Listing Strong Orientations.”,
Combinatorial Algorithms, Proceedings of 27th International Workshop,
IWOCA 2016, August 17-19, 2016, pages 83–95. |
[Ch2012] | Cho-Ho Chu. Jordan Structures in Geometry and
Analysis. Cambridge University Press, New
York. 2012. IBSN 978-1-107-01617-0. |
[Cha92] | Chameni-Nembua C. and Monjardet B.
Les Treillis Pseudocomplémentés Finis
Europ. J. Combinatorics (1992) 13, 89-107. |
[CK1999] | David A. Cox and Sheldon Katz. Mirror symmetry and
algebraic geometry, volume 68 of Mathematical Surveys
and Monographs. American Mathematical Society,
Providence, RI, 1999. |
[CK2001] | M. Casella and W. Kühnel, “A triangulated K3 surface with
the minimum number of vertices”, Topology 40 (2001),
753–772. |
[CKS1999] | Felipe Cucker, Pascal Koiran, and Stephen Smale. A polynomial-time
algorithm for diophantine equations in one variable, J. Symbolic
Computation 27 (1), 21-29, 1999. |
[CL2013] | Maria Chlouveraki and Sofia Lambropoulou. The
Yokonuma-Hecke algebras and the HOMFLYPT
polynomial. (2015) Arxiv 1204.1871v4. |
[CLRS2001] | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
and Clifford Stein, Section 22.4: Topological sort,
Introduction to Algorithms (2nd ed.), MIT Press and
McGraw-Hill, 2001, 549-552, ISBN 0-262-03293-7. |
[CLS2011] | David A. Cox, John Little, and Hal Schenck. Toric
Varieties. Volume 124 of Graduate Studies in
Mathematics. American Mathematical Society, Providence,
RI, 2011. |
[CMO2011] | C. Chun, D. Mayhew, J. Oxley, A chain theorem for
internally 4-connected binary matroids. J. Combin. Theory
Ser. B 101 (2011), 141-189. |
[CMO2012] | C. Chun, D. Mayhew, J. Oxley, Towards a splitter
theorem for internally 4-connected binary
matroids. J. Combin. Theory Ser. B 102 (2012), 688-700. |
[CMR2006] | C. Cid, S. Murphy, and M. Robshaw Algebraic Aspects
of the Advanced Encryption Standard; Springer Verlag
2006 |
[Co1984] | J. Conway, Hexacode and tetracode - MINIMOG and
MOG. Computational group theory, ed. M. Atkinson,
Academic Press, 1984. |
[Coh1993] | Henri Cohen. A Course in Computational Number
Theory. Graduate Texts in Mathematics 138. Springer, 1993. |
[Coh2007] | Henri Cohen, Number Theory,
Volume II. Graduate Texts in Mathematics 240. Springer, 2007. |
[CP2001] | John Crisp and Luis Paris. The solution to a conjecture
of Tits on the subgroup generated by the squares of the
generators of an Artin group. Invent. Math. 145
(2001). No 1, 19-36. Arxiv math/0003133. |
[CPdA2014] | Maria Chlouveraki and Loic Poulain
d’Andecy. Representation theory of the Yokonuma-Hecke
algebra. (2014) Arxiv 1302.6225v2. |
[CR1962] | Curtis, Charles W.; Reiner, Irving “Representation theory
of finite groups and associative algebras.” Pure and
Applied Mathematics, Vol. XI Interscience Publishers, a
division of John Wiley & Sons, New York-London 1962, pp
545–547 |
[Cre1997] | J. E. Cremona, Algorithms for Modular Elliptic
Curves. Cambridge University Press, 1997. |
[Cre2003] | Cressman, Ross. Evolutionary dynamics and extensive form
games. MIT Press, 2003. |
[CS1986] | J. Conway and N. Sloane. Lexicographic codes:
error-correcting codes from game theory, IEEE
Trans. Infor. Theory 32 (1986) 337-348. |
[Cu1984] | R. Curtis, The Steiner system \(S(5,6,12)\), the Mathieu
group \(M_{12}\), and the kitten. Computational group
theory, ed. M. Atkinson, Academic Press, 1984. |
[Cun1986] | W. H. Cunningham, Improved Bounds for Matroid Partition
and Intersection Algorithms. SIAM Journal on Computing
1986 15:4, 948-957 |
D
[Dat2007] | Basudeb Datta, “Minimal triangulations of
manifolds”, J. Indian Inst. Sci. 87 (2007), no. 4,
429-449. |
[Dav1997] | B.A. Davey, H.A. Priestley,
Introduction to Lattices and Order,
Cambridge University Press, 1997. |
[Dec1998] | W. Decker and T. de Jong. Groebner Bases and Invariant
Theory in Groebner Bases and Applications. London
Mathematical Society Lecture Note Series No. 251. (1998)
61–89. |
[DDLL2013] | Léo Ducas, Alain Durmus, Tancrède Lepoint and Vadim
Lyubashevsky. Lattice Signatures and Bimodal
Gaussians; in Advances in Cryptology – CRYPTO 2013;
Lecture Notes in Computer Science Volume 8042, 2013, pp
40-56 http://www.di.ens.fr/~lyubash/papers/bimodal.pdf |
[De1973] | P. Delsarte, An algebraic approach to the association
schemes of coding theory, Philips Res. Rep., Suppl.,
vol. 10, 1973. |
[De1974] | M. Demazure, Desingularisation des varietes de Schubert,
Ann. E. N. S., Vol. 6, (1974), p. 163-172 |
[Deh2011] | P. Dehornoy, Le probleme d’isotopie des tresses, in
Leçons mathématiques de Bordeaux, vol. 4, pages 259-300,
Cassini (2011). |
[deG2000] | Willem A. de Graaf. Lie Algebras: Theory and Algorithms.
North-Holland Mathematical Library. (2000).
Elsevier Science B.V. |
[Deo1987a] | V. Deodhar, A splitting criterion for the Bruhat
orderings on Coxeter groups. Comm. Algebra,
15:1889-1894, 1987. |
[Deo1987b] | V.V. Deodhar, On some geometric aspects of Bruhat
orderings II. The parabolic analogue of Kazhdan-Lusztig
polynomials, J. Alg. 111 (1987) 483-506. |
[DHSW2003] | Dumas, Heckenbach, Saunders, Welker, “Computing
simplicial homology based on efficient Smith normal form
algorithms,” in “Algebra, geometry, and software
systems” (2003), 177-206. |
[DI1989] | Dan Gusfield and Robert W. Irving. The stable marriage
problem: structure and algorithms. Vol. 54. Cambridge:
MIT press, 1989. |
[DI1995] | F. Diamond and J. Im, Modular forms and modular curves.
In: V. Kumar Murty (ed.), Seminar on Fermat’s Last Theorem
(Toronto, 1993-1994), 39-133. CMS Conference
Proceedings 17. American Mathematical Society, 1995. |
[DLMF-Bessel] | F. W. J. Olver and L. C. Maximon: 10. Bessel
Functions, in NIST Digital Library of Mathematical
Functions. http://dlmf.nist.gov/10 |
[DLMF-Error] | N. M. Temme: 7. Error Functions, Dawson’s and Fresnel
Integrals, in NIST Digital Library of Mathematical
Functions. http://dlmf.nist.gov/7 |
[DLMF-Struve] | R. B. Paris: 11. Struve and Related Functions, in
NIST Digital Library of Mathematical
Functions. http://dlmf.nist.gov/11 |
[DLRS2010] | De Loera, Rambau and Santos, “Triangulations: Structures
for Algorithms and Applications”, Algorithms and
Computation in Mathematics, Volume 25, Springer, 2011. |
[DN1990] | Claude Danthony and Arnaldo Nogueira “Measured foliations
on nonorientable surfaces”, Annales scientifiques de
l’Ecole Normale Superieure, Ser. 4, 23, no. 3 (1990) p
469-494 |
[DP2008] | Jean-Guillaume Dumas and Clement Pernet. Memory efficient
scheduling of Strassen-Winograd’s matrix multiplication
algorithm. arXiv:0707.2347v1, 2008. |
[DR2002] | Joan Daemen, Vincent Rijmen. The Design of
Rijndael. Springer-Verlag Berlin Heidelberg, 2002. |
[Du2003] | I. Duursma, “Extremal weight enumerators and
ultraspherical polynomials”, Discrete Mathematics 268
(2003), 103–127. |
[DW2007] | I. Dynnikov and B. Wiest, On the complexity of
braids, J. Europ. Math. Soc. 9 (2007) |
E
[Ed1974] | A. R. Edmonds, ‘Angular Momentum in Quantum Mechanics’,
Princeton University Press (1974) |
[EP2013] | David Einstein, James Propp. Combinatorial,
piecewise-linear, and birational homomesy for products of
two chains. Arxiv 1310.5294v1. |
[ERH2015] | Jorge Espanoza and Steen Ryom-Hansen. Cell structures
for the Yokonuma-Hecke algebra and the algebra of braids
and ties. (2015) Arxiv 1506.00715. |
[Ewa1996] | Ewald, “Combinatorial Convexity and Algebraic Geometry”,
vol. 168 of Graduate Texts in Mathematics, Springer, 1996 |
[EZ1950] | S. Eilenberg and J. Zilber, “Semi-Simplicial Complexes
and Singular Homology”, Ann. Math. (2) 51 (1950), 499-513. |
F
[Fe2012] | Hans L. Fetter, “A Polyhedron Full of Surprises”,
Mathematics Magazine 85 (2012), no. 5, 334-342. |
[Feu2009] | T. Feulner. The Automorphism Groups of Linear Codes and
Canonical Representatives of Their Semilinear Isometry
Classes. Advances in Mathematics of Communications 3 (4),
pp. 363-383, Nov 2009 |
[Feu2013] | Feulner, Thomas, “Eine kanonische Form zur Darstellung
aequivalenter Codes – Computergestuetzte Berechnung und
ihre Anwendung in der Codierungstheorie, Kryptographie
und Geometrie”, Dissertation, University of
Bayreuth, 2013. |
[FM2014] | Cameron Franc and Marc Masdeu, “Computing fundamental
domains for the Bruhat-Tits tree for GL_2(Qp), p-adic
automorphic forms, and the canonical embedding of Shimura
curves”. LMS Journal of Computation and Mathematics
(2014), volume 17, issue 01, pp. 1-23. |
[FOS2010] | G. Fourier, M. Okado, A. Schilling. Perfectness of
Kirillov-Reshetikhin crystals for nonexceptional types.
Contemp. Math. 506 (2010) 127-143 ( Arxiv 0811.1604 ) |
[FP1996] | Komei Fukuda, Alain Prodon: Double Description Method
Revisited, Combinatorics and Computer Science, volume 1120
of Lecture Notes in Computer Science, page
91-111. Springer (1996) |
[FR1985] | Friedl, Katalin, and Lajos Rónyai. “Polynomial time
solutions of some problems of computational
algebra”. Proceedings of the seventeenth annual ACM
symposium on Theory of computing. ACM, 1985. |
[FRT1990] | Faddeev, Reshetikhin and Takhtajan.
Quantization of Lie Groups and Lie Algebras.
Leningrad Math. J. vol. 1 (1990), no. 1. |
[FST2012] | A. Felikson, M. Shapiro, and P. Tumarkin, Cluster Algebras of
Finite Mutation Type Via Unfoldings, Int Math Res Notices (2012)
2012 (8): 1768-1804. |
[Fu1993] | Wiliam Fulton, Introduction to Toric Varieties,
Princeton University Press, 1993. |
[FY2004] | Eva Maria Feichtner and Sergey Yuzvinsky. Chow rings of
toric varieties defined by atomic lattices. Inventiones
Mathematicae. 155 (2004), no. 3, pp. 515-536. |
[FZ2007] | S. Fomin and A. Zelevinsky, Cluster algebras IV. Coefficients,
Compos. Math. 143 (2007), no. 1, 112-164. |
G
[Ga02] | Shuhong Gao, A new algorithm for decoding Reed-Solomon
Codes, January 31, 2002 |
[Gambit] | Richard D. McKelvey, Andrew M. McLennan, and
Theodore L. Turocy, Gambit: Software Tools for Game
Theory, Version 13.1.2.. http://www.gambit-project.org
(2014). |
[GDR1999] | R. González-Díaz and P. Réal, A combinatorial method
for computing Steenrod squares in J. Pure Appl. Algebra
139 (1999), 89-108. |
[GDR2003] | R. González-Díaz and P. Réal, Computation of cohomology
operations on finite simplicial complexes in Homology,
Homotopy and Applications 5 (2003), 83-93. |
[GGD2011] | E. Girondo, G. Gonzalez-Diez, Introduction to Compact
Riemann surfaces and Dessins d’enfant, (2011)
London Mathematical Society, Student Text 79. |
[GGOR2003] | V. Ginzberg, N. Guay, E. Opdam, R. Rouquier.
On the category `mathcal{O}` for rational Cherednik algebras.
Invent. Math. 154 (2003). Arxiv math/0212036. |
[GHJV1994] | E. Gamma, R. Helm, R. Johnson, J. Vlissides, Design
Patterns: Elements of Reusable Object-Oriented
Software. Addison-Wesley (1994). ISBN 0-201-63361-2. |
[GK2013] | Roland Grinis and Alexander Kasprzyk, Normal forms of
convex lattice polytopes, arXiv:1301.6641 |
[GKZ1994] | Gelfand, I. M.; Kapranov, M. M.; and
Zelevinsky, A. V. “Discriminants, Resultants and
Multidimensional Determinants” Birkhauser 1994 |
[GL1996] | G. Golub and C. van Loan. Matrix Computations. 3rd
edition, Johns Hopkins Univ. Press, 1996. |
[GM2002] | Daniel Goldstein and Andrew Mayer. On the equidistribution
of Hecke points. Forum Mathematicum, 15:2, pp. 165–189,
De Gruyter, 2003. |
[Go1967] | Solomon Golomb, Shift register sequences, Aegean Park
Press, Laguna Hills, Ca, 1967 |
[God1968] | R. Godement: Algebra, Hermann (Paris) / Houghton Mifflin
(Boston) (1968) |
[Gor1980] | Daniel Gorenstein, Finite Groups (New York: Chelsea
Publishing, 1980) |
[Gor2009] | Alexey G. Gorinov, “Combinatorics of double cosets and
fundamental domains for the subgroups of the modular
group”, preprint Arxiv 0901.1340 |
[GR2001] | C.Godsil and G.Royle, Algebraic Graph Theory. Graduate
Texts in Mathematics, Springer, 2001. |
[Gr2007] | J. Green, Polynomial representations of \(GL_n\), Springer
Verlag, 2007. |
[GrS1967] | Grunbaum and Sreedharan, “An enumeration of simplicial
4-polytopes with 8 vertices”, J. Comb. Th. 2,
437-465 (1967) |
[GS1999] | Venkatesan Guruswami and Madhu Sudan, Improved Decoding of
Reed-Solomon Codes and Algebraic-Geometric Codes, 1999 |
[GT1996] | P. Gianni and B. Trager. “Square-free algorithms in
positive characteristic”. Applicable Algebra in Engineering,
Communication and Computing, 7(1), 1-14 (1996) |
[GT2014] | M.S. Gowda and J. Tao. On the bilinearity rank of a
proper cone and Lyapunov-like
transformations. Mathematical Programming, 147 (2014)
155-170. |
[GZ1983] | Greene; Zaslavsky, “On the Interpretation of Whitney
Numbers Through Arrangements of Hyperplanes, Zonotopes,
Non-Radon Partitions, and Orientations of
Graphs”. Transactions of the American Mathematical
Society, Vol. 280, No. 1. (Nov., 1983), pp. 97-126. |
H
[Hat2002] | Allen Hatcher, “Algebraic Topology”, Cambridge University
Press (2002). |
[Hes2002] | F. Hess, “Computing Riemann-Roch spaces in algebraic
function fields and related topics,” J. Symbolic
Comput. 33 (2002), no. 4, 425–445. |
[Hig2008] | N. J. Higham, “Functions of matrices: theory and computation”,
Society for Industrial and Applied Mathematics (2008). |
[HJ2004] | Tom Hoeholdt and Joern Justesen, A Course In
Error-Correcting Codes, EMS, 2004 |
[HKOTY1999] | G. Hatayama, A. Kuniba, M. Okado, T. Tagaki, and Y. Yamada,
Remarks on fermionic formula. Contemp. Math., 248 (1999). |
[HL2014] | Thomas Hamilton and David Loeffler, “Congruence testing
for odd modular subgroups”, LMS J. Comput. Math. 17
(2014), no. 1, 206-208, doi:10.1112/S1461157013000338. |
[Hli2006] | Petr Hlineny, “Equivalence-free exhaustive generation of
matroid representations”, Discrete Applied Mathematics
154 (2006), pp. 1210-1222. |
[HLY2002] | Yi Hu, Chien-Hao Liu, and Shing-Tung Yau. Toric morphisms
and fibrations of toric Calabi-Yau
hypersurfaces. Adv. Theor. Math. Phys.,
6(3):457-506, 2002. arXiv:math/0010082v2 [math.AG]. |
[Hoc] | Winfried Hochstaettler, “About the Tic-Tac-Toe Matroid”,
preprint. |
[HP2003] | W. C. Huffman, V. Pless, Fundamentals of Error-Correcting
Codes, Cambridge Univ. Press, 2003. |
[HP2016] | S. Hopkins, D. Perkinson. “Bigraphical
Arrangements”. Transactions of the American Mathematical
Society 368 (2016), 709-725. Arxiv 1212.4398 |
[HPS2008] | J. Hoffstein, J. Pipher, and J.H. Silverman. An
Introduction to Mathematical
Cryptography. Springer, 2008. |
[HR2016] | Clemens Heuberger and Roswitha Rissner, “Computing
\(J\)-Ideals of a Matrix Over a Principal Ideal Domain”,
Arxiv 1611.10308, 2016. |
[Hsu1996] | Tim Hsu, “Identifying congruence subgroups of the modular
group”, Proc. AMS 124, no. 5, 1351-1359 (1996) |
[Hsu1997] | Tim Hsu, “Permutation techniques for coset
representations of modular subgroups”, in L. Schneps
(ed.), Geometric Galois Actions II: Dessins d’Enfants,
Mapping Class Groups and Moduli, volume 243 of LMS
Lect. Notes, 67-77, Cambridge Univ. Press (1997) |
[Huy2005] | D. Huybrechts : Complex Geometry, Springer (Berlin)
(2005). |
I
[IR1990] | K. Ireland and M. Rosen, A Classical Introduction to
Modern Number Theory, Springer-Verlag, GTM volume
84, 1990. |
[Iwa1964] | N. Iwahori, On the structure of a Hecke ring of a
Chevalley group over a finite
field, J. Fac. Sci. Univ. Tokyo Sect. I, 10 (1964),
215–236 (1964). MathSciNet MR0165016 |
[Iwa1972] | K. Iwasawa, Lectures on p-adic L-functions, Princeton
University Press, 1972. |
J
[Ja1971] | N. Jacobson. Exceptional Lie Algebras. Marcel Dekker,
Inc. New York. 1971. IBSN No. 0-8247-1326-5. |
[JL2009] | Nicolas Jacon and Cedric Lecouvey.
Kashiwara and Zelevinsky involutions in affine type A.
Pac. J. Math. 243(2):287-311 (2009). |
[Joh1990] | D.L. Johnson. Presentations of Groups. Cambridge
University Press. (1990). |
[Joy2004] | D. Joyner, Toric codes over finite fields, Applicable
Algebra in Engineering, Communication and Computing, 15,
(2004), p. 63-79. |
[Joy2006] | D. Joyner, On quadratic residue codes and hyperelliptic
curves, (preprint 2006) |
[JPdA15] | N. Jacon and L. Poulain d’Andecy. An isomorphism theorem
for Yokonuma-Hecke algebras and applications to link
invariants. (2015) Arxiv 1501.06389v3. |
K
[Ka1990] | Victor G. Kac. Infinite-dimensional Lie Algebras. Third
edition. Cambridge University Press, Cambridge, 1990. |
[Ka1993] | Masaki Kashiwara, The crystal base and Littelmann’s
refined Demazure character formula, Duke Math. J. 71
(1993), no. 3, 839–858. |
[Kal1980] | T. Kaliath, “Linear Systems”, Prentice-Hall, 1980,
383–386. |
[Kam2007] | Joel Kamnitzer,
The crystal structure on the set of Mirković-Vilonen polytopes,
Adv. Math. 215 (2007), 66-93. |
[Kam2010] | Joel Kamnitzer, Mirković-Vilonen cycles and polytopes,
Ann. Math. (2) 171 (2010), 731-777. |
[Kan1958] | D. M. Kan, A combinatorial definition of homotopy
groups, Ann. Math. (2) 67 (1958), 282-312. |
[KB1983] | W. Kühnel and T. F. Banchoff, “The 9-vertex complex
projective plane”, Math. Intelligencer 5 (1983), no. 3,
11-22. |
[Ke1991] | A. Kerber. Algebraic combinatorics via finite group
actions, 2.2 p. 70. BI-Wissenschaftsverlag,
Mannheim, 1991. |
[Ke2008] | B. Keller, Cluster algebras, quiver representations
and triangulated categories, Arxiv 0807.1960. |
[KK1995] | Victor Klee and Peter Kleinschmidt,
Convex polytopes and related complexes., in R. L. Graham,
M. Grötschel, L Lovász, Handbook of combinatorics,
Vol. 1, Chapter 18, 1995 |
[KKMMNN1992] | S-J. Kang, M. Kashiwara, K. C. Misra, T. Miwa, T. Nakashima,
and A. Nakayashiki. Affine crystals and vertex models.
Int. J. Mod. Phys. A, 7 (suppl. 1A), (1992) pp. 449-484. |
[KL2008] | Chris Kurth and Ling Long, “Computations with finite index
subgroups of \({\rm PSL}_2(\ZZ)\) using Farey symbols”,
Advances in algebra and combinatorics, 225–242, World
Sci. Publ., Hackensack, NJ, 2008. Preprint version:
Arxiv 0710.1835 |
[KLS2013] | Allen Knutson, Thomas Lam, and David Speyer.
Positroid Varieties: Juggling and Geometry
Compositio Mathematica, 149 (2013), no. 10.
Arxiv 1111.3660. |
[KMM2004] | Tomasz Kaczynski, Konstantin Mischaikow, and Marian
Mrozek, “Computational Homology”, Springer-Verlag (2004). |
[KMN2012] | On the trace of the antipode and higher
indicators. Yevgenia Kashina and Susan Montgomery and
Richard Ng. Israel J. Math., v.188, 2012. |
[KN1963] | S. Kobayashi & K. Nomizu : Foundations of Differential
Geometry, vol. 1, Interscience Publishers (New York)
(1963). |
[KNS2011] | Atsuo Kuniba and Tomoki Nakanishi and Junji Suzuki,
\(T\)-systems and \(Y\)-systems in integrable systems.
J. Phys. A, 44 (2011), no. 10. |
[Kob1993] | Neal Koblitz, Introduction to Elliptic Curves and
Modular Forms. Springer GTM 97, 1993. |
[Koe1999] | Wolfram Koepf: Effcient Computation of Chebyshev
Polynomials in Computer Algebra Systems: A Practical
Guide. John Wiley, Chichester (1999): 79-99. |
[Koh2000] | David Kohel, Hecke Module Structure of Quaternions, in
Class Field Theory — Its Centenary and Prospect (Tokyo,
1998), Advanced Studies in Pure Mathematics, 30,
177-196, 2000. |
[Kr1971] | D. Kraines, “On excess in the Milnor basis,” Bull. London
Math. Soc. 3 (1971), 363-365. |
[Kr2016] | Stefan Kranich, An epsilon-delta bound for plane algebraic curves
and its use for certified homotopy continuation of systems of plane
algebraic curves, arXiv:1505.03432 |
[KS1998] | Maximilian Kreuzer and Harald Skarke, Classification of
Reflexive Polyhedra in Three Dimensions,
arXiv:hep-th/9805190 |
[KS2002] | A. Khare and U. Sukhatme. “Cyclic Identities Involving
Jacobi Elliptic Functions”,
preprint 2002. Arxiv math-ph/0201004 |
[KSV2011] | Ian Kiming, Matthias Schuett and Helena Verrill, “Lifts
of projective congruence groups”, J. London
Math. Soc. (2011) 83 (1): 96-120,
doi:10.1112/jlms/jdq062. Arxiv version:
Arxiv 0905.4798. |
[KT1986] | N. Kerzman and M. R. Trummer. “Numerical Conformal
Mapping via the Szego kernel”. Journal of Computational
and Applied Mathematics, 14(1-2): 111–123, 1986. |
[Kuh1987] | W. Kühnel, “Minimal triangulations of Kummer varieties”,
Abh. Math. Sem. Univ. Hamburg 57 (1987), 7-20. |
[Kuh1995] | Kuhnel, “Tight Polyhedral Submanifolds and Tight
Triangulations” Lecture Notes in Mathematics Volume 1612,
1995 |
[Kul1991] | Ravi Kulkarni, “An arithmetic geometric method in the
study of the subgroups of the modular group”, American
Journal of Mathematics 113 (1991), no 6, 1053-1133 |
[KZ2003] | M. Kontsevich, A. Zorich “Connected components of the
moduli space of Abelian differentials with prescripebd
singularities” Invent. math. 153, 631-678 (2003) |
L
[Lam2005] | T. Lam, Affine Stanley symmetric functions,
Amer. J. Math. 128 (2006), no. 6, 1553–1586. |
[Lam2008] | T. Lam. Schubert polynomials for the affine
Grassmannian. J. Amer. Math. Soc., 2008. |
[Lan2008] | E. Lanneau “Connected components of the strata of the
moduli spaces of quadratic differentials”, Annales
sci. de l’ENS, serie 4, fascicule 1, 41, 1-56 (2008) |
[Lau2011] | Alan G.B. Lauder, “Computations with classical and p-adic
modular forms”, LMS J. of Comput. Math. 14 (2011),
214-231. |
[LdB1982] | A. Liberato de Brito, ‘FORTRAN program for the integral
of three spherical harmonics’, Comput. Phys. Commun.,
Volume 25, pp. 81-85 (1982) |
[Lev2014] | Lionel Levine. Threshold state and a conjecture of
Poghosyan, Poghosyan, Priezzhev and Ruelle,
Communications in Mathematical Physics. |
[Lew2000] | Robert Edward Lewand. Cryptological Mathematics. The
Mathematical Association of America, 2000. |
[Li1995] | Peter Littelmann, Crystal graphs and Young
tableaux, J. Algebra 175 (1995), no. 1, 65–87. |
[Lic1997] | William B. Raymond Lickorish. An Introduction to Knot
Theory, volume 175 of Graduate Texts in
Mathematics. Springer-Verlag, New York, 1997. ISBN
0-387-98254-X |
[Lin1999] | J. van Lint, Introduction to coding theory, 3rd ed.,
Springer-Verlag GTM, 86, 1999. |
[LLZ2014] | K. Lee, L. Li, and A. Zelevinsky, Greedy elements in rank 2
cluster algebras, Selecta Math. 20 (2014), 57-82. |
[LM2006] | Vadim Lyubashevsky and Daniele Micciancio. Generalized
compact knapsacks are collision resistant. ICALP,
pp. 144–155, Springer, 2006. |
[LMR2010] | N. Linial, R. Meshulam and M. Rosenthal, “Sum complexes
– a new family of hypertrees”, Discrete & Computational
Geometry, 2010, Volume 44, Number 3, Pages 622-636 |
[Loe2007] | David Loeffler, Spectral expansions of overconvergent
modular functions, Int. Math. Res. Not 2007 (050).
Arxiv preprint. |
[LP2011] | Richard Lindner and Chris Peikert. Better key sizes (and
attacks) for LWE-based encryption. in Proceeding of the
11th international conference on Topics in cryptology:
CT-RSA 2011. Springer 2011,
doi:10.1007/978-3-642-19074-2_21 |
[LPR2010] | Vadim Lyubashevsky, Chris Peikert, and Oded Regev. On
Ideal Lattices and Learning with Errors over Rings. in
Advances in Cryptology –
EUROCRYPT 2010. Springer 2010. doi:10.1007/978-3-642-13190-5_1 |
[LSS2009] | T. Lam, A. Schilling, M. Shimozono. Schubert
polynomials for the affine Grassmannian of the symplectic
group. Mathematische Zeitschrift 264(4) (2010) 765-811
(Arxiv 0710.2720) |
[LT2009] | G.I. Lehrer and D.E. Taylor. Unitary reflection
groups. Australian Mathematical Society Lecture
Series, 2009. |
[Lut2005] | Frank H. Lutz, “Triangulated Manifolds with Few Vertices:
Combinatorial Manifolds”, preprint (2005),
Arxiv math/0506372 |
[LTV1999] | Bernard Leclerc, Jean-Yves Thibon, and Eric Vasserot.
Zelevinsky’s involution at roots of unity.
J. Reine Angew. Math. 513:33-51 (1999). |
[LW2012] | David Loeffler and Jared Weinstein, On the computation of
local components of a newform, Mathematics of Computation
81 (2012) 1179-1200. doi:10.1090/S0025-5718-2011-02530-5 |
[Lyo2003] | R. Lyons, Determinantal probability
measures. Publications Mathematiques de l’Institut des
Hautes Etudes Scientifiques 98(1) (2003), pp. 167-212. |
M
[Mat2002] | Jiří Matousek, “Lectures on Discrete Geometry”, Springer,
2002 |
[Ma2009] | Sarah Mason, An Explicit Construction of Type A Demazure
Atoms, Journal of Algebraic Combinatorics, Vol. 29,
(2009), No. 3, p.295-313. Arxiv 0707.4267 |
[Mac1915] | Percy A. MacMahon, Combinatory Analysis,
Cambridge University Press (1915–1916).
(Reprinted: Chelsea, New York, 1960). |
[MAR2009] | H. Molina-Abril and P. Réal, Homology computation using
spanning trees in Progress in Pattern Recognition, Image
Analysis, Computer Vision, and Applications, Lecture
Notes in Computer Science, volume 5856, pp 272-278,
Springer, Berlin (2009). |
[Mas1969] | James L. Massey, “Shift-Register Synthesis and BCH
Decoding.” IEEE Trans. on Information Theory, vol. 15(1),
pp. 122-127, Jan 1969. |
[May1964] | J. P. May, “The cohomology of restricted Lie algebras
and of Hopf algebras; application to the Steenrod
algebra.” Thesis, Princeton Univ., 1964. |
[May1967] | J. P. May, Simplicial Objects in Algebraic Topology,
University of Chicago Press (1967) |
[McC1978] | K. McCrimmon. Jordan algebras and their
applications. Bull. Amer. Math. Soc. 84 1978. |
[McM1992] | John McMillan. Games, strategies, and managers. Oxford
University Press. |
[Mil1958] | J. W. Milnor, “The Steenrod algebra and its dual,”
Ann. of Math. (2) 67 (1958), 150-171. |
[MMY2003] | Jean-Christophe Yoccoz, Stefano Marmi and Pierre Moussa
“On the cohomological equation for interval exchange
maps”, C. R. Acad. Sci. Paris, projet de Note, 2003
Systèmes dynamiques/Dynamical
Systems. Arxiv math/0304469v1 |
[MM2015] | J. Matherne and G. Muller, Computing upper cluster algebras,
Int. Math. Res. Not. IMRN, 2015, 3121-3149. |
[MNO1994] | Alexander Molev, Maxim Nazarov, and Grigori Olshanski.
Yangians and classical Lie algebras. (1994)
Arxiv hep-th/9409025 |
[Mol2007] | Alexander Ivanovich Molev.
Yangians and Classical Lie Algebras.
Mathematical Surveys and Monographs.
Providence, RI: American Mathematical Society. (2007) |
[Mon1998] | K. G. Monks, “Change of basis, monomial relations, and
\(P^s_t\) bases for the Steenrod algebra,” J. Pure
Appl. Algebra 125 (1998), no. 1-3, 235-260. |
[MR1989] | G. Melançon and C. Reutenauer.
Lyndon words, free algebras and shuffles,
Can. J. Math., Vol. XLI, No. 4, 1989, pp. 577-591. |
[MR2002] | S. Murphy, M. Robshaw Essential Algebraic Structure
Within the AES; in Advances in Cryptology - CRYPTO
2002; LNCS 2442; Springer Verlag 2002 |
[MS2003] | T. Mulders, A. Storjohann, “On lattice reduction for
polynomial matrices”, J. Symbolic Comput. 35 (2003),
no. 4, 377–401 |
[MS2011] | G. Musiker and C. Stump, A compendium on the cluster algebra
and quiver package in sage, Arxiv 1102.4844. |
[MSZ2013] | Michael Maschler, Solan Eilon, and Zamir Shmuel. Game
Theory. Cambridge: Cambridge University Press,
(2013). ISBN 9781107005488. |
[MV2010] | D. Micciancio, P. Voulgaris. A Deterministic Single
Exponential Time Algorithm for Most Lattice Problems based
on Voronoi Cell Computations. Proceedings of the 42nd ACM
Symposium Theory of Computation, 2010. |
[MvOV1996] | A. J. Menezes, P. C. van Oorschot,
and S. A. Vanstone. Handbook of Applied
Cryptography. CRC Press, 1996. |
[MW2009] | Meshulam and Wallach, “Homological connectivity of random
\(k\)-dimensional complexes”, preprint, math.CO/0609773. |
N
[Nas1950] | John Nash. Equilibrium points in n-person games.
Proceedings of the National Academy of Sciences 36.1
(1950): 48-49. |
[Nie2013] | Johan S. R. Nielsen, List Decoding of Algebraic Codes,
Ph.D. Thesis, Technical University of Denmark, 2013 |
[NN2007] | Nisan, Noam, et al., eds. Algorithmic game theory.
Cambridge University Press, 2007. |
[Nog1985] | Arnaldo Nogueira, “Almost all Interval Exchange
Transformations with Flips are Nonergodic” (Ergod. Th. &
Dyn. Systems, Vol 5., (1985), 257-271 |
[NZ2012] | T. Nakanishi and A. Zelevinsky, On tropical dualities in
cluster algebras, Algebraic groups and quantum groups,
Contemp. Math., vol. 565, Amer. Math. Soc.,
Providence, RI, 2012, pp. 217-226. |
O
[ONe1983] | B. O’Neill : Semi-Riemannian Geometry, Academic Press
(San Diego) (1983) |
[Oxl1992] | James Oxley, Matroid theory, Oxford University
Press, 1992. |
[Oxl2011] | James Oxley, Matroid Theory, Second Edition. Oxford
University Press, 2011. |
P
[PALP] | Maximilian Kreuzer, Harald Skarke: “PALP: A Package for
Analyzing Lattice Polytopes with Applications to Toric
Geometry” omput.Phys.Commun. 157 (2004) 87-106
Arxiv math/0204356 |
[Pen2012] | R. Pendavingh, On the evaluation at \((-i, i)\) of the
Tutte polynomial of a binary matroid. Preprint:
Arxiv 1203.0910 |
[Pha2002] | R. C.-W. Phan. Mini advanced encryption standard
(mini-AES): a testbed for cryptanalysis
students. Cryptologia, 26(4):283–306, 2002. |
[Piz1980] | A. Pizer. An Algorithm for Computing Modular Forms on
\(\Gamma_0(N)\), J. Algebra 64 (1980), 340-390. |
[Pon2010] | S. Pon. Types B and D affine Stanley symmetric
functions, unpublished PhD Thesis, UC Davis, 2010. |
[Pos2005] | A. Postnikov, Affine approach to quantum Schubert
calculus, Duke Math. J. 128 (2005) 473-509 |
[PPW2013] | Perlman, Perkinson, and Wilmes. Primer for the algebraic
geometry of sandpiles. Tropical and Non-Archimedean
Geometry, Contemp. Math., 605, Amer. Math. Soc.,
Providence, RI, 2013. |
[PR2015] | P. Pilarczyk and P. Réal, Computation of cubical
homology, cohomology, and (co)homological operations via
chain contraction, Adv. Comput. Math. 41 (2015), pp
253–275. |
[PS2011] | R. Pollack, and G. Stevens. Overconvergent modular
symbols and p-adic L-functions. Annales scientifiques de
l’Ecole normale superieure.
Vol. 44. No. 1. Elsevier, 2011. |
[PvZ2010] | R. A. Pendavingh, S. H. M. van Zwam, Lifts of matroid
representations over partial fields, Journal of
Combinatorial Theory, Series B, Volume 100, Issue 1,
January 2010, Pages 36-67 |
[PZ2008] | J. H. Palmieri and J. J. Zhang, “Commutators in the
Steenrod algebra,” New York J. Math. 19 (2013), 23-37. |
R
[Raj1987] | A. Rajan, Algorithmic applications of connectivity and
related topics in matroid theory. Ph.D. Thesis,
Northwestern university, 1987. |
[Rau1979] | Gerard Rauzy, “Echanges d’intervalles et transformations
induites”, Acta Arith. 34, no. 3, 203-212, 1980 |
[Reg09] | Oded Regev. On Lattices, Learning with Errors, Random
Linear Codes, and Cryptography. in Journal of the ACM
56(6). ACM 2009, doi:10.1145/1060590.1060603 |
[Reg1958] | T. Regge, ‘Symmetry Properties of Clebsch-Gordan
Coefficients’, Nuovo Cimento, Volume 10, pp. 544 (1958) |
[Reg1959] | T. Regge, ‘Symmetry Properties of Racah Coefficients’,
Nuovo Cimento, Volume 11, pp. 116 (1959) |
[Reg2005] | Oded Regev. On lattices, learning with errors, random
linear codes, and cryptography. STOC, pp. 84–93,
ACM, 2005. |
[Reu1993] | C. Reutenauer. Free Lie Algebras. Number 7 in London
Math. Soc. Monogr. (N.S.). Oxford University
Press. (1993). |
[Rho69] | John Rhodes, Characters and complexity of finite semigroups
J. Combinatorial Theory, vol 6, 1969 |
[RH2003] | J. Rasch and A. C. H. Yu, ‘Efficient Storage Scheme for
Pre-calculated Wigner 3j, 6j and Gaunt Coefficients’,
SIAM J. Sci. Comput. Volume 25, Issue 4,
pp. 1416-1428 (2003) |
[Rio1958] | J. Riordan, “An Introduction to Combinatorial Analysis”,
Dover Publ. (1958) |
[Ris2016] | Roswitha Rissner, “Null ideals of matrices over residue
class rings of principal ideal domains”. Linear Algebra
Appl., 494 (2016) 44–69. doi:10.1016/j.laa.2016.01.004. |
[RMA2009] | P. Réal and H. Molina-Abril, Cell AT-models for digital
volumes in Torsello, Escolano, Brun (eds.), Graph-Based
Representations in Pattern Recognition, Lecture Notes in
Computer Science, volume 5534, pp. 314-3232, Springer,
Berlin (2009). |
[RNPA2011] | G. Rudolf, N. Noyan, D. Papp, and F. Alizadeh. Bilinear
optimality constraints for the cone of positive
polynomials. Mathematical Programming, Series B,
129 (2011) 5-31. |
[Roc1970] | R.T. Rockafellar, Convex Analysis. Princeton
University Press, Princeton, 1970. |
[Rot2006] | Ron Roth, Introduction to Coding Theory, Cambridge
University Press, 2006 |
[Rud1958] | M. E. Rudin. An unshellable triangulation of a
tetrahedron. Bull. Amer. Math. Soc. 64 (1958), 90-91. |
S
[Sch1996] | E. Schaefer. A simplified data encryption
algorithm. Cryptologia, 20(1):77–84, 1996. |
[Sch2006] | Oliver Schiffmann. Lectures on Hall algebras,
preprint, 2006. Arxiv 0611617v2. |
[SE1962] | N. E. Steenrod and D. B. A. Epstein, Cohomology
operations, Ann. of Math. Stud. 50 (Princeton University
Press, 1962). |
[Ser2010] | F. Sergeraert, Triangulations of complex projective
spaces in Scientific contributions in honor of Mirian
Andrés Gómez, pp 507-519, Univ. La Rioja Serv. Publ., Logroño (2010). |
[SH1995] | C. P. Schnorr and H. H. Hörner. Attacking the
Chor-Rivest Cryptosystem by Improved Lattice
Reduction. Advances in Cryptology - EUROCRYPT ‘95. LNCS
Volume 921, 1995, pp 1-12. |
[Shr2004] | Shreve, S. Stochastic Calculus for Finance II:
Continuous-Time Models. New York: Springer, 2004 |
[SK2011] | J. Spreer and W. Kühnel, “Combinatorial properties of the
K3 surface: Simplicial blowups and slicings”, Experimental
Mathematics, Volume 20, Issue 2, 2011. |
[Sky2003] | Brian Skyrms. The stag hunt and the evolution of social
structure. Cambridge University Press, 2003. |
[SLB2008] | Shoham, Yoav, and Kevin Leyton-Brown. Multiagent
systems: Algorithmic, game-theoretic, and logical
foundations. Cambridge University Press, 2008. |
[Spe2013] | D. Speyer, An infinitely generated upper cluster algebra,
Arxiv 1305.6867. |
[SS1992] | M. A. Shtan’ko and M. I. Shtogrin, “Embedding cubic
manifolds and complexes into a cubic lattice”, Uspekhi
Mat. Nauk 47 (1992), 219-220. |
[SS2015] | Anne Schilling and Travis Scrimshaw.
Crystal structure on rigged configurations and the filling map.
Electon. J. Combin., 22(1) (2015) #P1.73. Arxiv 1409.2920. |
[SS2015II] | Ben Salisbury and Travis Scrimshaw.
A rigged configuration model for \(B(\infty)\).
J. Combin. Theory Ser. A, 133 (2015) pp. 29-75.
Arxiv 1404.6539. |
[SS2017] | Ben Salisbury and Travis Scrimshaw.
Rigged configurations for all symmetrizable types.
Electon. J. Combin., 24(1) (2017) #P1.30. Arxiv 1509.07833. |
[ST2011] | A. Schilling, P. Tingley. Demazure crystals,
Kirillov-Reshetikhin crystals, and the energy function.
Electronic Journal of Combinatorics. 19(2). 2012.
Arxiv 1104.2359 |
[Sta2007] | Stanley, Richard: Hyperplane Arrangements, Geometric
Combinatorics (E. Miller, V. Reiner, and B. Sturmfels,
eds.), IAS/Park City Mathematics Series, vol. 13,
American Mathematical Society, Providence, RI, 2007,
pp. 389-496. |
[Ste2003] | John R. Stembridge, A local characterization of
simply-laced crystals, Transactions of the American
Mathematical Society, Vol. 355, No. 12 (Dec., 2003),
pp. 4807–4823 |
[Sti2006] | Douglas R. Stinson. Cryptography: Theory and
Practice. 3rd edition, Chapman & Hall/CRC, 2006. |
[Sto1998] | A. Storjohann, An O(n^3) algorithm for Frobenius normal
form. Proceedings of the International Symposium on
Symbolic and Algebraic Computation (ISSAC‘98), ACM Press,
1998, pp. 101-104. |
[Sto2000] | A. Storjohann, Algorithms for Matrix Canonical
Forms. PhD Thesis. Department of Computer Science, Swiss
Federal Institute of Technology – ETH, 2000. |
[Sto2011] | A. Storjohann, Email Communication. 30 May 2011. |
[Str1969] | Volker Strassen. Gaussian elimination is not
optimal. Numerische Mathematik, 13:354-356, 1969. |
[Stu1987] | J. Sturm, On the congruence of modular forms, Number
theory (New York, 1984-1985), Springer, Berlin, 1987,
pp. 275-280. |
[Stu1993] | B. Sturmfels, Algorithms in invariant theory, Springer-Verlag,
1993. |
[STW2016] | C. Stump, H. Thomas, N. Williams. Cataland II, in
preparation, 2016. |
[Swe1969] | Moss Sweedler. Hopf algebras. W.A. Benjamin, Math Lec
Note Ser., 1969. |
[SWJ2008] | Fatima Shaheen, Michael Wooldridge, and Nicholas
Jennings. A linear approximation method for the Shapley
value. Artificial Intelligence 172.14 (2008): 1673-1699. |
T
[Tar1976] | Robert E. Tarjan, Edge-disjoint spanning trees and
depth-first search, Acta Informatica 6 (2), 1976,
171-185, doi:10.1007/BF00268499. |
[TB1997] | Lloyd N. Trefethen and David Bau III, Numerical Linear
Algebra, SIAM, Philadelphia, 1997. |
[TW1980] | A.D. Thomas and G.V. Wood, Group Tables (Exeter: Shiva
Publishing, 1980) |
U
V
[VB1996] | E. Viterbo, E. Biglieri. Computing the Voronoi Cell of a
Lattice: The Diamond-Cutting Algorithm. IEEE Transactions
on Information Theory, 1996. |
[Vee1978] | William Veech, “Interval exchange
transformations”, J. Analyse Math. 33 (1978), 222-272 |
[Voe2003] | V. Voevodsky, Reduced power operations in motivic
cohomology, Publ. Math. Inst. Hautes Études Sci. No. 98
(2003), 1-57. |
[Voi2012] | J. Voight. Identifying the matrix ring: algorithms for
quaternion algebras and quadratic forms, to appear. |
[VW1994] | Leonard Van Wyk. Graph groups are biautomatic. J. Pure
Appl. Alg. 94 (1994). no. 3, 341-352. |
W
[Wac2003] | Wachs, “Topology of Matching, Chessboard and General
Bounded Degree Graph Complexes” (Algebra Universalis
Special Issue in Memory of Gian-Carlo Rota, Algebra
Universalis, 49 (2003) 345-385) |
[Wal1960] | C. T. C. Wall, “Generators and relations for the
Steenrod algebra,” Ann. of Math. (2) 72 (1960),
429-444. |
[Wal1970] | David W. Walkup, “The lower bound conjecture for 3- and
4-manifolds”, Acta Math. 125 (1970), 75-107. |
[Wan1998] | Daqing Wan, “Dimension variation of classical and p-adic
modular forms”, Invent. Math. 133, (1998) 449-463. |
[Wan2010] | Zhenghan Wang. Topological quantum
computation. Providence, RI: American Mathematical
Society (AMS), 2010. ISBN 978-0-8218-4930-9 |
[Was1997] | L. C. Washington, Cyclotomic Fields, Springer-Verlag,
GTM volume 83, 1997. |
[Wat2003] | Joel Watson. Strategy: an introduction to game
theory. WW Norton, 2002. |
[Wat2010] | Watkins, David S. Fundamentals of Matrix Computations,
Third Edition. Wiley, Hoboken, New Jersey, 2010. |
[Web2007] | James Webb. Game theory: decisions, interaction and
Evolution. Springer Science & Business Media, 2007. |
[Wei1994] | Charles A. Weibel, An introduction to homological
algebra. Cambridge Studies in Advanced Math., vol. 38,
Cambridge Univ. Press, 1994. |
[Woo1998] | R. M. W. Wood, “Problems in the Steenrod algebra,”
Bull. London Math. Soc. 30 (1998), no. 5, 449-517. |
X
[XP1994] | Deng Xiaotie, and Christos Papadimitriou. On the
complexity of cooperative solution concepts. Mathematics
of Operations Research 19.2 (1994): 257-266. |
Y
[Yoc2005] | Jean-Christophe Yoccoz “Echange d’Intervalles”, Cours au
college de France |
[Yun1976] | Yun, David YY. On square-free decomposition
algorithms. In Proceedings of the third ACM symposium on
Symbolic and algebraic computation, pp. 26-35. ACM, 1976. |
[Yuz1993] | Sergey Yuzvinsky, “The first two obstructions to the
freeness of arrangements”, Transactions of the American
Mathematical Society, Vol. 335, 1 (1993)
pp. 231–244. |
Z
[ZBN1997] | C. Zhu, R. H. Byrd and J. Nocedal. L-BFGS-B: Algorithm
778: L-BFGS-B, FORTRAN routines for large scale bound
constrained optimization. ACM Transactions on
Mathematical Software, Vol 23, Num. 4, pp.550–560, 1997. |
[Zie1998] | G. M. Ziegler. Shelling polyhedral 3-balls and
4-polytopes. Discrete Comput. Geom. 19 (1998), 159-174. |
[Zie2007] | G. M. Ziegler. Lectures on polytopes, Volume
152 of Graduate Texts in Mathematics, 7th printing of 1st edition, Springer, 2007. |
[Zor2008] | A. Zorich “Explicit Jenkins-Strebel representatives of
all strata of Abelian and quadratic differentials”,
Journal of Modern Dynamics, vol. 2, no 1, 139-185 (2008)
(http://www.math.psu.edu/jmd) |
[ZZ2005] | Hechun Zhang and R. B. Zhang.
Dual canonical bases for the quantum special linear group
and invariant subalgebras.
Lett. Math. Phys. 73 (2005), pp. 165-181.
Arxiv math/0509651. |