Searcharxiv⌕ Search

arXiv subjects

Morteza Mohammad-Noori

Publications and source records attributed to Morteza Mohammad-Noori.

6 recordsLinked to original sources

A Unified Theory of Sinusoidal Activation Families for Implicit Neural Representations

Implicit Neural Representations (INRs) model continuous signals with compact neural networks and have become a standard tool in vision, graphics, and signal processing. A central challenge is accurately capturing fine detail without heavy hand-crafted encodings or brittle training heuristics. Across the literature, periodic activations have emerged as a compelling remedy: from SIREN, which uses a single sinusoid with a fixed global frequency, to more recent architectures employing multiple sinusoids and, in some cases, trainable frequencies and phases. We study this family of sinusoidal activations and develop a principled theoretical and practical framework for trainable sinusoidal activations in INRs. Concretely, we instantiate this framework with Sinusoidal Trainable Activation Functions (STAF), a Fourier-like activation whose amplitudes, frequencies, and phases are learned. Our analysis (i) establishes a Kronecker-equivalence construction that expresses trainable sinusoidal activations with standard sine networks and quantifies expressive growth, (ii) characterizes how the Neural Tangent Kernel (NTK) spectrum changes under trainable sinusoidal parameterization, and (iii) provides an initialization that yields standard normal post-activations without asymptotic central limit theorem (CLT) arguments. Empirically, on images, audio, shapes, inverse problems (super-resolution, denoising) and NeRF, STAF is competitive and often stronger on distortion-oriented reconstruction metrics such as PSNR/SSIM across the evaluated INR tasks, with favorable parameter efficiency under layer-wise sharing. While periodic activations can alleviate practical manifestations of spectral bias, our results indicate they do not eliminate it; instead, trainable sinusoids can improve the observed capacity-optimization trade-off in the evaluated settings.

cs.CV↗

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs

In the GEODETIC SET problem, an input is a (di)graph $G$ and integer $k$, and the objective is to decide whether there exists a vertex subset $S$ of size $k$ such that any vertex in $V(G)\setminus S$ lies on a shortest (directed) path between two vertices in $S$. The problem has been studied on undirected and directed graphs from both algorithmic and graph-theoretical perspectives. We focus on directed graphs and prove that GEODETIC SET admits a polynomial-time algorithm on ditrees, that is, digraphs with possible 2-cycles when the underlying undirected graph is a tree (after deleting possible parallel edges). This positive result naturally leads us to investigate cases where the underlying undirected graph is "close to a tree". Towards this, we show that GEODETIC SET on digraphs without 2-cycles and whose underlying undirected graph has feedback edge set number $\textsf{fen}$, can be solved in time $2^{\mathcal{O}(\textsf{fen})} \cdot n^{\mathcal{O}(1)}$, where $n$ is the number of vertices. To complement this, we prove that the problem remains NP-hard on DAGs (which do not contain 2-cycles) even when the underlying undirected graph has constant feedback vertex set number and constant pathwidth. Our last result significantly strengthens the result of Araújo and Arraes [Discrete Applied Mathematics, 2022] that the problem is NP-hard on DAGs when the underlying undirected graph is either bipartite, cobipartite or split.

cs.DS↗

Enumeration of Factor Occurrences in $k$-Bonacci Words over an Infinite Alphabet

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in the finite iterates. For $k \ge 3$, we obtain closed forms for the generating functions (with respect to the iteration index) that count the number of occurrences of an arbitrary digit in the $n$th iterate. We then characterize the complete set of length-$2$ factors occurring in the infinite word and compute, for each such factor, a closed form for the generating function encoding its number of occurrences across all finite iterates. As a consequence, the associated counting sequences satisfy uniform $(k\!-\!1)$-step Fibonacci-type recurrences and admit a description in terms of $(k\!-\!1)$-Bonacci enumeration phenomena, including self-convolution structures.

math.CO↗

Generalized Gapped-kmer Filters for Robust Frequency Estimation

In this paper, we study the generalized gapped k-mer filters and derive a closed form solution for their coefficients. We consider nonnegative integers $\ell$ and $k$, with $k\leq \ell$, and an $\ell$-tuple $B=(b_1,\ldots,b_{\ell})$ of integers $b_i\geq 2$, $i=1,\ldots,\ell$. We introduce and study an incidence matrix $A=A_{\ell,k;B}$. We develop a Möbius-like function $ν_B$ which helps us to obtain closed forms for a complete set of mutually orthogonal eigenvectors of $A^{\top} A$ as well as a complete set of mutually orthogonal eigenvectors of $AA^{\top}$ corresponding to nonzero eigenvalues. The reduced singular value decomposition of $A$ and combinatorial interpretations for the nullity and rank of $A$, are among the consequences of this approach. We then combine the obtained formulas, some results from linear algebra, and combinatorial identities of elementary symmetric functions and $ν_B$, to provide the entries of the Moore-Penrose pseudo-inverse matrix $A^{+}$ and the Gapped k-mer filter matrix $A^{+} A$.

cs.DM↗

Some properties of $k$-bonacci words on infinite alphabet

The Fibonacci word $W$ on an infinite alphabet was introduced in [Zhang et al., Electronic J. Combinatorics 2017 24(2), 2-52] as a fixed point of the morphism $2i\rightarrow (2i)(2i+1)$, $(2i+1) \rightarrow (2i+2)$, $i\geq 0$. Here, for any integer $k>2$, we define the infinite $k$-bonacci word $W^{(k)}$ on the infinite alphabet as the fixed point of the morphism $φ_k$ on the alphabet $\mathbb{N}$ defined for any $i\geq 0$ and any $0\leq j\leq k-1$, as \begin{equation*} φ_k(ki+j) = \left\{ \begin{array}{ll} (ki)(ki+j+1) & \text{if } j = 0,\cdots ,k-2,\\ (ki+j+1)& \text{otherwise}. \end{array} \right. \end{equation*} We consider the sequence of finite words $(W^{(k)}_n)_{n\geq 0}$, where $W^{(k)}_n$ is the prefix of $W^{(k)}$ whose length is the $(n+k)$-th $k$-bonacci number. We then provide a recursive formula for the number of palindromes occur in different positions of $W^{(k)}_n$. Finally, we obtain the structure of all palindromes occurring in $W^{(k)}$ and based on this, we compute the palindrome complexity of $W^{(k)}$, for any $k>2$.

math.CO↗

Enumeration of closed random walks in the square lattice according to their areas

We study the area distribution of closed walks of length $n$, beginning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefulness of the new concept is demonstrated through a simple argument. It is concluded that the number of walks of length $n$ and area $s$ equals to the coefficient of $z^s$ in the expression $(x+x^{-1}+y+y^{-1})^n$, where the calculations are performed in a special group ring $R[x,y,z]$. A polynomial time algorithm for calculating these values, is then concluded. Finally, the provided algorithm and the results of implementation are compared with previous works.

math.CO↗