top of page

Publications

  1. S. Fried and M. Shattuck, Counting s-Catalan Words According to Total Variation, Enumerative Combinatorics and Applications 6 (2)2026.

  2. S. Fried, On the inverse of a certain triangular matrix and its connection to the largest odd divisor, Notes on Number Theory and Discrete Mathematics 32 (2), 2026.

  3. S. Fried, Proofs of ten conjectures from the OEIS, Journal of Integer Sequences 29 (1), 2026.

  4. S. Fried, T. Mansour, and M. Shattuck, Counting k-ary words by number of adjacency differences of a prescribed size, Journal of Combinatorics 17 (2)2026.

  5. S. Fried, Cyclic up-down words, Osječki matematički list 26 (1), 2026.

  6. S. Fried, On a conjecture of McNeil, to appear in Mathematical Communications, 2025.

  7. S. Fried and M. Shattuck, Counting adjacencies with difference at most one in k-ary words, Ars Combinatoria 1642025.

  8. S. Fried, Proofs of several conjectures from the OEIS, Journal of Integer Sequences 28 (4), 2025.

  9. S. Fried, Solving the Tower of Hanoi with heavy disks, American Mathematical Monthly 132 (8), 2025.

  10. S. Fried and T. Mansour, Random walk labelings of perfect trees and other graphs, Quaestiones Mathematicae 48 (6)2025.

  11. S. Fried and T. Mansour, Counting r × s rectangles in (Catalan) words, Discrete Applied Mathematics 365, 2025.

  12. S. Fried, Counting rectangles of size r × s in nondecreasing and Smirnov words, Journal of Integer Sequences 27 (8), 2024.

  13. S. Fried and T. Mansour, On the maximal sum of the entries of a matrix power, Art of Discrete and Applied Mathematics 7 (3), 2024.

  14. S. Fried and T. Mansour, Further results on random walk labelings, Discrete Applied Mathematics 353, 2024.

  15. S. Fried, Problem, to appear in the College Mathematics Journal, March, 2026.

  16. S. Fried and T. Mansour, The total number of descents and levels in (cyclic) tensor wordsDiscrete Mathematics Letters 13, 2024.

  17. S. Fried, 1273College Mathematics Journal 55 (2), 2024.

  18. S. Fried and T. Mansour, Staircase graph words, FILOMAT, 38 (18) 2024.

  19. S. Fried and T. Mansour, Graph labelings obtainable by random walks, Art of Discrete and Applied Mathematics 7 (1), 2024.

  20. S. Fried, 12497, American Mathematical Monthly 131 (10), 2024.

  21. S. Fried, 2189, Mathematics Magazine 97 (1), 2024.

  22. S. Fried, 1285, College Mathematics Journal 55 (4), 2024.

  23. S. Fried and D. Haran, Θ-Hilbertianity and strong Θ-Hilbertianity, Israel Journal of Mathematics 257 (1), 2023.

  24. S. Fried, On the α-lazy version of Markov chains in estimation and testing problems, Statistical Inference for Stochastic Processes 26 (2), 2023.

  25. S. Fried, The minimal sum of squares over partitions with a nonnegative rank, Annals of Combinatorics 27, 2023.

  26. S. Fried, The expected degree of noninvertibility of compositions of functions, Journal of Integer Sequences 25 (8), 2022.

  27. S. Fried and G. Wolfer, Identity testing of reversible Markov chains, Int. Conf. on Artificial Intelligence and Statistics (AISTATS), 2022.

  28. S. Fried, On the coefficients of the distinct monomials in the expansion of $x_1(x_1 + x_2)\cdots(x_1 + x_2 + \cdots + x_n)$, Journal of Integer Sequences 25 (4), 2022.

  29. S. Fried, The restrictiveness of the hazard rate order and the moments of the maximal coordinate of a random vector uniformly distributed on the probability $n$-simplex, Statistics & Probability Letters 185, 2022.

  30. S. Fried, On the restrictiveness of the usual stochastic order and the likelihood ratio order, Statistics & Probability Letters 170, 2021.

  31. S. Fried and D. Haran, Θ-Hilbertianity, Journal of Algebra 555, 2020.

  32. S. Fried and D. Haran, Quasi-formations, Israel Journal of Mathematics 229 (1), 2019.

Preprints

Miscellaneous

  1. I regularly contribute to the On-Line Encyclopedia of Integer Sequences and as of 7/1/26 I am an associate editor.

  2. The beauty of Beatty sequences, 2022.

  3. The beauty of Beatty sequences - Part II, 2023.                                   (~50 MB)

©2022 by Sela Fried. Proudly created with Wix.com

bottom of page