Elena Rubei - Publications List

Elena Rubei's publications list


Research papers (published or accepted)

  1. E. Rubei, "Characterization of the morphisms between Jacobians induced by the morphisms between Riemann surfaces" Rivista di Matematica dell'Universita' di Parma 5, 41-50 (1996).
     
  2. E. Rubei, "Lazzeri's Jacobian of oriented compact riemannian manifolds", Arkiv foer Mathematik 38 (2), 381-397 (2000).
     
  3. E. Rubei, "Projective normality of abelian varieties with a line bundle of type (2,...)", Bollettino U.M.I. Sez. B Articoli di Ricerca Matematica (8) 1 (2), 361-367 (1998).
     
  4. E. Rubei, "On normal generation of line bundles on abelian threefolds", Kodai Math. J. 22 (1), 15-34 (1999).
     
  5. E. Rubei, "On syzygies of abelian varieties", Transactions of the American Mathematical Society 352 (6), 2569-2579 (2000).
     
  6. E. Rubei, "A note on Property N_p", Manuscripta Mathematica 101, 449-455 (2000).
     
  7. E. Rubei, "On Koszul rings, syzygies, abelian varieties", Communications in Algebra 29 (12), 5631-5640 (2001).
     
  8. E. Rubei, "On syzygies on Segre embeddings", Proceedings of the American Mathematical Society 130 (12), 3483-3493 (2002)
     
  9. E. Rubei, "A strange example on Property N_p", Manuscripta Mathematica 108, 135-137 (2002)
     
  10. E. Rubei, "A result on resolutions of Veronese embeddings", Annali di Matematica dell'Univ. di Ferrara Sez.VII Sc. Mat. Vol. L, 151-165 (2004).
     
  11. G. Ottaviani, E. Rubei, "Resolutions of homogeneous bundles on P^2", Annales de L'Institut Fourier 55 (3), 973-1015 (2005), DOI:10.5802/aif.2119. pp.973-1015
     
  12. G. Ottaviani, E. Rubei, "Quivers and the cohomology of of homogeneous vector bundles", Duke Math. J. 132 (3), 459-508 (2006), DOI: 10.1215/S0012-7094-06-13233-7
     
  13. E. Rubei, "Resolutions of Segre emebeddings of projective spaces of any dimension", Journal of Pure and Applied Algebra 208, 29-37 (2007).
     
  14. E. Rubei "A note on trees and codes" International Journal of Pure and Applied Mathematics 71 (1), 49-56 (2011)
     
  15. E.Rubei "Sets of double and triple weights of trees", Annals of Combinatorics 15 (4), 723-734 (2011), DOI:10.1007/s00026-011-0118-1
     
  16. M. Chan, A.N. Jensen, E. Rubei "The 4x4 minors of a 5xn matrix are a tropical basis", Linear Algebra and its Applications 435 (7), 1598-1611 (2011), DOI: 10.1016/j.laa.2010.09.032
     
  17. E. Rubei "Stability of homogeneous bundles on P^3", Geometriae Dedicata 158 (1), 1-21 (2012), DOI:10.1007/s10711-011-9617-9
     
  18. E.Rubei "On dissimilarity vectors of general weighted trees" Discrete Mathematics 312 (19) 2872-2880 (2012), DOI: 10.1016/j.disc.2012.06.001
     
  19. E.Rubei "On the slope of the Schur functor of a vector bundle" International Journal of Pure and Applied Mathematics 86, 521-526 (2013), DOI: 10.12732/ijpam.v86i3.6
     
  20. E. Rubei "On the weights of simple paths in weighted complete graphs" Indian Journal of Pure and Applied Mathematics 44 (4), 511-525 (2013), DOI: 10.1007/s13226-013-0027-6
     
  21. E. Rubei "On completions of symmetric and antisymmetric block diagonal partial matrices" Linear Algebra and its Applications 439 (10), 2971-2979 (2013), DOI:10.1016/j.laa.2013.08.033
     
  22. A. Baldisserri, E. Rubei "On graphlike k-dissimilarity vectors" Annals of Combinatorics 18 (3), 365-381 (2014), DOI:10.1007/s00026-014-0228-7
     
  23. E. Rubei "Weighted graphs with distances in given ranges" Journal of Classification 33(2), 282-297 (2016), DOI: 10.1007/s00357-016-9206-6
     
  24. A. Baldisserri, E. Rubei "Families of multiweights and pseudostars" Advances in Applied Mathematics 77, 86-100 (2016), DOI:10.1016/j.aam.2016.03.001
     
  25. S.Calamai, E. Rubei "Treelike quintet systems" Seminaire Lotharingien de Combinatoire 76 (2016)
     
  26. A. Baldisserri, E. Rubei "A characterization of dissimilarity families of trees" Discrete Applied Mathematics 220, 35-45 (2017), DOI: 10.1016/j.dam.2016.12.007
     
  27. A. Baldisserri, E. Rubei "Treelike families of multiweights" Journal of Classification 35, 367-390 (2018), DOI: 10.1007/s00357-018-9260-3
     
  28. A.Baldisserri, E. Rubei "Distance matrices of some positive-weighted graphs" Australasian Journal of Combinatorics 70(2), 185-201 (2018)
     
  29. E. Rubei "On rank range of interval matrices" Linear Algebra and its Applications 561, 81-97 (2019), DOI:10.1016/j.laa.2018.09.018
     
  30. E. Rubei "A generalization of Rohn's theorem on full-rank interval matrices" Linear and Multilinear Algebra, 68 (5), 931-939, (2020), DOI:10.1080/03081087.2018.1521366
     
  31. E.Rubei "Generalization of real interval matrices to other fields" The Electronic Journal of Linear Algebra, 35, 285-296 (2019), DOI:10.13001/1081-3810.3953
     
  32. E. Rubei, D. Villanis Ziani "A characterization of distance matrices of weighted cubic graphs and Petersen graphs" Journal of Multiple-Valued Logic and Soft Computing 34, 479-497 (2020)
     
  33. E. Rubei "Interval matrices: realization of ranks by rational matrices", Linear Algebra and its Applications 608, 299-321 (2021), DOI: 10.1016/j.laa.2020.09.01
     
  34. E.Rubei "Affine subspaces of matrices with constant rank" Linear Algebra and its Applications, 644, 259-269 (2022), DOI: 10.1016/j.laa.2022.03.002
     
  35. E. Rubei "Affine subspaces of antisymmetric matrices with constant rank", arXiv:2209.07633, to appear in Linear and Multilinear Algebra
     
     
    Research Preprints

     
  36. E.Rubei "On tropical and Kapranov ranks of tropical matrices", arXiv:0712.3007
     
  37. A.Baldisserri, E. Rubei "Graphlike families of multiweights", arXiv:1606.09183
     
  38. E. Rubei "Maximal dimension of affine subspaces of specific matrices" arXiv:2303.10629
     

    Books

    1. E. Rubei "Algebraic Geometry - A concise dictionary", Berlin, De Gruyter , 2014, http://www.degruyter.com/view/product/207032 Algebraic Geometry - A concise dictionary
       
    2. E. Rubei "Geometria e Algebra Lineare" Pearson , 2016 (Errata Corrige)

    Other works

    • E. Rubei, "Abelian varieties: their projective geometry applications to riemannian manifolds" tesi di perfezionamento, Scuola Normale Superiore di Pisa, defended in February 1998.
       
    • A. Colesanti, E.Rubei "Appunti per il corso di Laboratorio di Matematica" per il 1 anno del corso di laurea in Matematica a.a. 1999-2000
       
    • A. Colesanti, S. Dolfi, E.Rubei "Dispense di Laboratorio di Matematica" per il 1 anno del corso di laurea in Matematica File pdf
       

    Programs about interval matrices


      Main programs (the input mu must be given as the two matrices m and M, containing respectively the minima and the maxima of the entries of mu):
  39. rk01: for any interval matrix mu, it says if mrk(mu) is 0, 1 or greater than 1;
  40. mrkpx3: for any interval matrix mu with 3 columns, it calculates mrk(mu);
  41. rkmax: for any interval pxp matrix mu, it calculates if Mrk(mu)=p.

    Auxiliary programs:
  42. reduce: it reduces the interval matrices, that is eliminates from the interval matrix [m,M] the rows containing (0,....,0) and the columns containing the transpose of (0,...,0)
  43. multisubsets: mutisubsets(p,k) calculates the k-multisubsets of {1,...,p}; each is given in lexicographic order
  44. orderedmultisubsets: orderedmultisubsets(p,k) calculates the ordered k-multisubsets of {1,...,p}
  45. rk1nnr.m: given a reduced interval matrix mu with entries contained in the set of the nonnegative real numbers, it says whether mu contains a matrix with rank 1;
  46. sist: it says whether a systems as in Corollary 16 of the paper is solvable;
  47. rklesseq2: given a reduced interval p x 3-matrix mu with the entries of the first column contained in the set of nonnegative real numbers, the program says whether mrk(mu) <= 2.
  48. nondegpgdiag: the program gives the totally nondegenerate pg diagonals of length k of an interval square matrix [m,M]; precisely it gives a matrix U such that the first half and the second half of every row are the indices of a totally nondgenerate pg-diagonal of [m,M]
  49. scelta: given a matrix X and a column Y the program gives a matrix whose rows are all the rows obtained taking a row r of X and adding to it an element e of Y if e is not element of r
  50. sceltabis: given an array of columns Y, the program gives a matrix U whose rows are obtained by taking an element a1 from Y(1), then an element from Y(2) different from a1 and so on