Vadim Ponomarenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vadim Ponomarenko has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Reza Farhadian
Department of Statistics, Razi University, Kermanshah, Iran
5 shared publications - Christopher O'Neill
Mathematics Department, San Diego State University, San Diego, CA 92182, USA
4 shared publications Cole Brower
Department of Mathematics and Statistics, San Diego State University, San Diego, CA, United States
2 shared publications- Jackson Autry
Texas A&M University
2 shared publications Samuel Yih
Department of Mathematics, Pomona College, Claremont, CA, United States
2 shared publications- Alex Domat1 shared publication
Latest Publications
- Open Access
A Closed Form for the Pulsar Sequence
In this paper, we study the Pulsar Sequence, an integer sequence derived from Latin-square-based Pulsar puzzles introduced by the Cracking the Cryptic YouTube channel. A Pulsar puzzle consists of two interlocked spirals of circled and uncircled squares, generating the Dual and Pulsar sequences, respectively. We investigate the properties of the Pulsar puzzle and focus our work on constructing the Pulsar Sequence, allowing us to solve a Pulsar puzzle of any size. A general formula to calculate any term of the Pulsar Sequence is proposed at the end of the paper.
Open AccessA Closed Form for the Pulsar Sequence
In this paper, we study the Pulsar Sequence, an integer sequence derived from Latin-square-based Pulsar puzzles introduced by the Cracking the Cryptic YouTube channel. A Pulsar puzzle consists of two interlocked spirals of circled and uncircled squares, generating the Dual and Pulsar sequences, respectively. We investigate the properties of the Pulsar puzzle and focus our work on constructing the Pulsar Sequence, allowing us to solve a Pulsar puzzle of any size. A general formula to calculate any term of the Pulsar Sequence is proposed at the end of the paper.
- Open Access
The Pulsar Sequence
A sequence of positive integers is introduced, that is proved to simultaneously solve an infinite family of related puzzles, one of which was recently featured on the popular YouTube sudoku channel \emph{Cracking the Cryptic}.
Open AccessThe Pulsar Sequence
A sequence of positive integers is introduced, that is proved to simultaneously solve an infinite family of related puzzles, one of which was recently featured on the popular YouTube sudoku channel \emph{Cracking the Cryptic}.
- 20 June 2025
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 109 (575) , 338-341
109.26 A simple self-improvement of the Cauchy-Schwarz inequality
109.26 A simple self-improvement of the Cauchy-Schwarz inequality - Volume 109 Issue 575
- 20 June 2025
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 109 (575) , 338-341
109.26 A simple self-improvement of the Cauchy-Schwarz inequality
109.26 A simple self-improvement of the Cauchy-Schwarz inequality - Volume 109 Issue 575
- Open Access
On numerical semigroup elements and the $\ell_0$- and $\ell_\infty$-norms of their factorizations
A numerical semigroup $S$ is a cofinite, additively-closed subset of $\mathbb Z_{\ge 0}$ that contains 0, and a factorization of $x \in S$ is a $k$-tuple $z = (z_1, \ldots, z_k)$ where $x = z_1a_1 + \cdots + z_ka_k$ expresses $x$ as a sum of generators of $S = \langle a_1, \ldots, a_k \rangle$. Much~of the study of non-unique factorization centers on factorization length $z_1 + \cdots + z_k$, which coincies with the $\ell_1$-norm of $z$ as the $k$-tuple. In this paper, we study the $\ell_\infty$-norm and $\ell_0$-norm of factorizations, viewed as alternative notions of length, with particular focus on the generalizations $Δ_\infty(x)$ and $Δ_0(x)$ of the delta set $Δ(x)$ from classical factorization length. We prove that the $\infty$-delta set $Δ_\infty(x)$ is eventually periodic as a function of $x \in S$, classify $Δ_\infty(S)$ and the 0-delta set $Δ_0(S)$ for several well-studied families of numerical semigroups, and identify families of numerical semigroups demonstrating $Δ_\infty(S)$ and $Δ_0(S)$ can be arbitrarily long intervals and can avoid arbitrarily long subintervals.Open AccessOn numerical semigroup elements and the $\ell_0$- and $\ell_\infty$-norms of their factorizations
A numerical semigroup $S$ is a cofinite, additively-closed subset of $\mathbb Z_{\ge 0}$ that contains 0, and a factorization of $x \in S$ is a $k$-tuple $z = (z_1, \ldots, z_k)$ where $x = z_1a_1 + \cdots + z_ka_k$ expresses $x$ as a sum of generators of $S = \langle a_1, \ldots, a_k \rangle$. Much~of the study of non-unique factorization centers on factorization length $z_1 + \cdots + z_k$, which coincies with the $\ell_1$-norm of $z$ as the $k$-tuple. In this paper, we study the $\ell_\infty$-norm and $\ell_0$-norm of factorizations, viewed as alternative notions of length, with particular focus on the generalizations $Δ_\infty(x)$ and $Δ_0(x)$ of the delta set $Δ(x)$ from classical factorization length. We prove that the $\infty$-delta set $Δ_\infty(x)$ is eventually periodic as a function of $x \in S$, classify $Δ_\infty(S)$ and the 0-delta set $Δ_0(S)$ for several well-studied families of numerical semigroups, and identify families of numerical semigroups demonstrating $Δ_\infty(S)$ and $Δ_0(S)$ can be arbitrarily long intervals and can avoid arbitrarily long subintervals. - Open Access
Some asymptotic results on $p$-lengths of factorizations for numerical semigroups and arithmetical congruence monoids
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We introduce the notion of $p$-length, a generalized notion of factorization length obtained from the $\ell_p$-norm of the sequence $(z_1, \ldots, z_k)$, and present asymptotic results on extremal $p$-lengths of factorizations for large elements of numerical semigroups (additive submonoids of $\mathbb Z_{\ge 0}$) and arithmetical congruence monoids (certain multiplicative submonoids of $\mathbb Z_{\ge 1}$). Our results, inspired by analogous results for classical factorization length, demonstrate the types of combinatorial statements one may hope to obtain for sufficiently nice monoids, as well as the subtlety such asymptotic questions can have for general monoids.Open AccessSome asymptotic results on $p$-lengths of factorizations for numerical semigroups and arithmetical congruence monoids
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We introduce the notion of $p$-length, a generalized notion of factorization length obtained from the $\ell_p$-norm of the sequence $(z_1, \ldots, z_k)$, and present asymptotic results on extremal $p$-lengths of factorizations for large elements of numerical semigroups (additive submonoids of $\mathbb Z_{\ge 0}$) and arithmetical congruence monoids (certain multiplicative submonoids of $\mathbb Z_{\ge 1}$). Our results, inspired by analogous results for classical factorization length, demonstrate the types of combinatorial statements one may hope to obtain for sufficiently nice monoids, as well as the subtlety such asymptotic questions can have for general monoids. - 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 329-331
108.27 More on the Euler limit for e
108.27 More on the Euler limit for e - Volume 108 Issue 572
- 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 329-331
108.27 More on the Euler limit for e
108.27 More on the Euler limit for e - Volume 108 Issue 572
- 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 334-335
108.29 A geometric mean–arithmetic mean ratio limit
108.29 A geometric mean–arithmetic mean ratio limit - Volume 108 Issue 572
- 1 July 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (572) , 334-335
108.29 A geometric mean–arithmetic mean ratio limit
108.29 A geometric mean–arithmetic mean ratio limit - Volume 108 Issue 572
- 15 February 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (571) , 146-148
108.13 Indeterminate exponentials without tears
- 15 February 2024
- Published by Taylor & Francis in The Mathematical Gazette
- Vol. 108 (571) , 146-148
108.13 Indeterminate exponentials without tears
- 10 August 2023
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 16 (3) , 431-452
The elliptical case of an odds inversion problem
- 10 August 2023
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 16 (3) , 431-452
The elliptical case of an odds inversion problem
- Open Access
- 23 December 2022
- Published by California State University, Office of the Chancellor in The PUMP Journal of Undergraduate Research
- Vol. 5, 206-217
Sums of Two Generalized Tetrahedral Numbers
Expressing whole numbers as sums of figurate numbers, including tetrahedral numbers, is a longstanding problem in number theory. Pollock's tetrahedral number conjecture states that every positive integer can be expressed as the sum of at most five tetrahedral numbers. Here we explore a generalization of this conjecture to negative indices. We provide a method for computing sums of two generalized tetrahedral numbers up to a given bound, and explore which families of perfect powers can be expressed as sums of two generalized tetrahedral numbers.
- 23 December 2022
- Published by California State University, Office of the Chancellor in The PUMP Journal of Undergraduate Research
- Vol. 5, 206-217
Open AccessSums of Two Generalized Tetrahedral Numbers
Expressing whole numbers as sums of figurate numbers, including tetrahedral numbers, is a longstanding problem in number theory. Pollock's tetrahedral number conjecture states that every positive integer can be expressed as the sum of at most five tetrahedral numbers. Here we explore a generalization of this conjecture to negative indices. We provide a method for computing sums of two generalized tetrahedral numbers up to a given bound, and explore which families of perfect powers can be expressed as sums of two generalized tetrahedral numbers.