Related papers: Extending Hridaya Kolam to Even-Ordered Dot Patter…
This paper extends Hridaya Kolam patterns to cases where the number of dots ($m$) and arms ($n$) are not coprime, i.e., $\gcd(m, n) \ne 1$. Such configurations give rise to multiple disjoint closed loops. We propose a…
Pulli kolam is a ubiquitous art form in south India. It involves drawing a line looped around a collection of dots (pullis) place on a plane such that three mandatory rules are followed: all line orbits should be closed, all dots are…
Kolam is a ritual art form practised by people in South India and consists of rule-bound geometric patterns of dots and lines. Single loop Kolams are mathematical closed loop patterns drawn over a grid of dots and conforming to certain…
In south India, there are traditional patterns of line-drawings encircling dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam'' provide very interesting questions in mathematics. For example, we address the…
Pulli Kolam is an ancient mathematical artform that is still practiced today in south India by over a quarter million people. "Pulli" in the Tamil language means dots. A specific type of pulli kolam is "sikku" kolam where a series of dots…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
In this work, following the discrete de Rham (DDR) approach, we develop a discrete counterpart of a two-dimensional de Rham complex with enhanced regularity. The proposed construction supports general polygonal meshes and arbitrary…
This paper introduces Pulli Kolam, a traditional South Indian craft, as a medium for physical data representation. Grounded in its cultural meaning and embodied practice, Pulli Kolam follows structured geometric rules while allowing…
We introduce the notion of $\mathrm{R}$-Eulerian sequences for any $\mathcal{N}_\infty$-ring spectrum $\mathrm{R}$ of finite orientation order. We prove that each $\mathrm{R}$-Eulerian sequence determines a stable $\mathrm{R}$-cohomology…
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…
Golay complementary sequences have been put a high value on the applications in orthogonal frequency-division multiplexing (OFDM) systems since its good peak-to-mean envelope power ratio(PMEPR) properties. However, with the increase of the…
The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
Diagrammatic techniques to compute perturbatively the spectral properties of Euclidean Random Matrices in the high-density regime are introduced and discussed in detail. Such techniques are developed in two alternative and very different…
When using ordinal patterns, which describe the ordinal structure within a data vector, the problem of ties appeared permanently. So far, model classes were used which do not allow for ties; randomization has been another attempt to…
Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In the sublinear-time regime, the relaxed problem of approximate…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
We discover a novel connection between two classical mathematical notions, Eulerian orientations and Hadamard codes by studying the counting problem of Eulerian orientations (\#EO) with local constraint functions imposed on vertices. We…
We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…
We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…