Searcharxiv⌕ Search

arXiv subjects

Vadim Ponomarenko

Publications and source records attributed to Vadim Ponomarenko.

At least 19 recordsLinked to original sources

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.

math.HO↗

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}.

math.HO↗

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.

math.AC↗

Betti elements and full atomic support in rings and monoids

Several papers in the recent literature have studied factorization properties of affine monoids using the monoid's Betti elements. In this paper, we extend this study to more general rings and monoids. We open by demonstrating the issues with computing the complete set of Betti elements of a general commutative cancellative monoid, and as an example compute this set for an algebraic number ring of class number two. We specialize our study to the case where the monoid has a single Betti element, before examining monoids with full atomic support (that is, when each Betti element is divisible by every atom). For such a monoid, we show that the catenary degree, tame degree, and omega value agree and can be computed using the monoid's set of Betti elements. We close by considering Betti elements in block monoids, giving a "Carlitz-like" characterization of block monoids with full atomic support and proving that these are precisely the block monoids having a unique Betti element.

math.AC↗

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.

math.AC↗

Perspicacious $l_p$ norm parameters

Fix $t\in [1,\infty]$. Let $S$ be an atomic commutative semigroup and, for all $x\in S$, let $\mathscr{L}_t(S):=\{\|f\|_t:f\in Z(x)\}$ be the "$t$-length set" of $x$ (using the standard $l_p$-space definition of $\|\cdot\|_t$). The $t$-Delta set of $x$ (denoted $Δ_t(S)$) is the set of gaps between consecutive elements of $\mathscr{L}_t(S)$; the Delta set of $S$ is then defined by $\bigcup\limits_{x\in S} Δ_t(S)$. Though all existing literature on this topic considers the $1$-Delta set, recent results on the $t$-elasticity of Numerical Semigroups (Behera et. al.) for $t\neq 1$ have brought attention to other invariants, such as the $t$-Delta set for $t\neq 1$, as well. Here we characterize $Δ_t(S)$ for all numerical semigroups $\langle a_1,a_2\rangle$ and all $t\in(1,\infty)$ outside a small family of extremal examples. We also determine the cardinality and describe the distribution of that aberrant family.

math.AC↗

Unusual quasiparticles and tunneling conductance in quantum point contacts in $ν=2/3$ fractional quantum Hall systems

Understanding topological matter in the fractional quantum Hall (FQH) effect requires identifying the nature of edge state quasiparticles. FQH edge state at the filling factor $ν=2/3$ in the spin-polarized and non-polarized phases is represented by the two modes of composite fermions (CF) with the parallel or opposite spins described by the chiral Luttinger liquids. Tunneling through a quantum point contact (QPC) in such systems between different or similar spin phases is solved exactly. With the increase of the applied voltage, the QPC conductance grows from zero and saturates at $e^2/2h$ while a weak electron tunneling between the edge modes with the same spin transforms into a backscattering carried by the charge $q=e/2$ quasiparticles. These unusual quasiparticles and conductance plateau emerge in the QPC with one or two CF modes scattering into a single mode, as occurs in these systems. We propose experiments on the applied voltage and temperature dependence of the QPC conductance and noise that can shed light on the nature of edge states and FQH transport.

cond-mat.mes-hall↗

Length density and numerical semigroups

Length density is a recently introduced factorization invariant, assigned to each element $n$ of a cancellative commutative atomic semigroup $S$, that measures how far the set of factorization lengths of $n$ is from being a full interval. We examine length density of elements of numerical semigroups (that is, additive subsemigroups of the non-negative integers).

math.AC↗

Transport in helical Luttinger liquids in the fractional quantum Hall regime

Domain walls in fractional quantum Hall ferromagnets are gapless helical one-dimensional channels formed at the boundaries of topologically distinct quantum Hall (QH) liquids. Naïvely, these helical domain walls (hDWs) constitute two counter-propagating chiral states with opposite spins. Coupled to an s-wave superconductor, helical channels are expected to lead to topological superconductivity with high order non-Abelian excitations. Here we investigate transport properties of hDWs in the $ν=2/3$ fractional QH regime. Experimentally we found that current carried by hDWs is substantially smaller than the prediction of the naïve model. Luttinger liquid theory of the system reveals redistribution of currents between quasiparticle charge, spin and neutral modes, and predicts the reduction of the hDW current. Inclusion of spin-non-conserving tunneling processes reconciles theory with experiment. The theory confirms emergence of spin modes required for the formation of fractional topological superconductivity.

cond-mat.mes-hall↗

Complementary Numerical Sets

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements. We determine various properties of $\widetilde{S}$, particularly with an eye to closure under addition (for both $S$ and $\widetilde{S}$), which promotes a numerical set to become a numerical semigroup.

math.CO↗

On length densities

For a commutative cancellative monoid $M$, we introduce the notion of the length density of both a nonunit $x\in M$, denoted $\mathrm{LD}(x)$, and the entire monoid $M$, denoted $\mathrm{LD}(M)$. This invariant is related to three widely studied invariants in the theory of non-unit factorizations, $L(x)$, $\ell(x)$, and $ρ(x)$. We consider some general properties of $\mathrm{LD}(x)$ and $\mathrm{LD}(M)$ and give a wide variety of examples using numerical semigroups, Puiseux monoids, and Krull monoids. While we give an example of a monoid $M$ with irrational length density, we show that if $M$ is finitely generated, then $\mathrm{LD}(M)$ is rational and there is a nonunit element $x\in M$ with $\mathrm{LD}(M)=\mathrm{LD}(x)$ (such a monoid is said to have accepted length density). While it is well-known that the much studied asymptotic versions of $L(x)$, $\ell (x)$ and $ρ(x)$ (denoted $\overline{L}(x)$, $\overline{\ell}(x)$, and $\overlineρ (x)$) always exist, we show the somewhat surprising result that $\overline{\mathrm{LD}}(x) = \lim_{n\rightarrow \infty} \mathrm{LD}(x^n)$ may not exist. We also give some finiteness conditions on $M$ that force the existence of $\overline{\mathrm{LD}}(x)$.

math.AC↗

Elasticity in Apery sets

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers, containing zero, with finite complement. Its multiplicity $m$ is its smallest nonzero element. The Apery set of $S$ is the set $\text{Ap}(S) = \{n \in S : n-m \notin S\}$. Fixing a numerical semigroup, we ask how many elements of its Apery set have nonunique factorization, and define several new invariants.

math.AC↗

Augmented Hilbert series of numerical semigroups

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a rational function in $t$ whose numerator is characterized in terms of the topology of a simplicial complex determined by membership in $S$. In this paper, we obtain analogous rational expressions for the related power series whose coefficient of $t^n$ equals $f(n)$ for one of several semigroup-theoretic invariants $f:S \to \mathbb R$ known to be eventually quasipolynomial.

math.AC↗

Membership and elasticity in certain affine monoids

For affine monoids of dimension 2 with embedding dimension 2 and 3, we study the problem of determining when a vector is an element of the monoid, and the problem of determining the elasticity of a monoid element.

math.AC↗

Squarefree divisor complexes of certain numerical semigroup elements

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $Δ_m$ that arises in the study of multigraded Betti numbers. We compute squarefree divisor complexes for certain classes numerical semigroups, and exhibit a new family of simplicial complexes that are occur as the squarefree divisor complex of some numerical semigroup element.

math.AC↗

On the set of catenary degrees of finitely generated cancellative commutative monoids

The catenary degree of an element $n$ of a cancellative commutative monoid $S$ is a nonnegative integer measuring the distance between the irreducible factorizations of $n$. The catenary degree of the monoid $S$, defined as the supremum over all catenary degrees occurring in $S$, has been heavily studied as an invariant of nonunique factorization. In this paper, we investigate the set $\mathsf C(S)$ of catenary degrees achieved by elements of $S$ as a factorization invariant, focusing on the case where $S$ in finitely generated (where $\mathsf C(S)$ is known to be finite). Answering an open question posed by García-Sánchez, we provide a method to compute the smallest nonzero element of $\mathsf C(S)$ that parallels a well-known method of computing the maximum value. We also give several examples demonstrating certain extremal behavior for $\mathsf C(S)$, and present some open questions for further study.

math.AC↗

Numerical semigroups on compound sequences

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots, b_1b_2b_3\cdots b_p\}$ a \emph{compound sequence}. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Apéry sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.

math.AC↗

Arithmetic-Progression-Weighted Subsequence Sums

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i {a term of} W,\, w_i\neq w_j{for} i\neq j\},$$ which is a particular kind of weighted restricted sumset. We show that $|W\odot S|\geq \min\{|G|-1,\,n\}$, that $W\odot S=G$ if $n\geq |G|+1$, and also characterize all sequences $S$ of length $|G|$ with $W\odot S\neq G$. This result then allows us to characterize when a linear equation $$a_1x_1+...+a_rx_r\equiv α\mod n,$$ where $α,a_1,..., a_r\in \Z$ are given, has a solution $(x_1,...,x_r)\in \Z^r$ modulo $n$ with all $x_i$ distinct modulo $n$. As a second simple corollary, we also show that there are maximal length minimal zero-sum sequences over a rank 2 finite abelian group $G\cong C_{n_1}\oplus C_{n_2}$ (where $n_1\mid n_2$ and $n_2\geq 3$) having $k$ distinct terms, for any $k\in [3,\min\{n_1+1,\,\exp(G)\}]$. Indeed, apart from a few simple restrictions, any pattern of multiplicities is realizable for such a maximal length minimal zero-sum sequence.

math.NT↗