ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “generating functions”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DMTheoreticalRecentJun 11, 2026

Fibonacci and Catalan Numbers Meet in Staircase Polyominoes

Jean-Luc Baril, José Luis Ramírez, Samuel Ramírez, Diego Villamizar

This paper derives multivariate generating functions to refine the enumeration of Fibonacci polyominoes.

View →
cs.DMmath.COmath.DSTheoreticalRecentJun 11, 2026

The Curious Case of Reversible Elementary Second Order Cellular Automaton 115

Enrico Formenti, Supreeti Kamylia

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
cs.CRcs.FLcs.MSRecentMar 20, 2026

Cellular Automata based Resource Efficient Maximally Equidistributed Pseudo-Random Number Generators

Bhuvaneswari A, Kamalika Bhattacharjee

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

View →
cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

View →
cs.DScs.DMTheoreticalRecentJun 11, 2026

(Un)ranking Permutation Classes

Nathanaël Hassler, Vincent Vajnovszki

This paper presents methods for ranking and unranking permutations avoiding a pattern of length three in lexicographic or colexicographic order.

View →
cs.DMcs.DSEmpiricalRecentJun 11, 2026

Exhaustive Generation of Genus-One Knot and Link Diagrams via Maps on the Torus

Alexander Omelchenko

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

View →
cs.DScs.AIcs.CLRecentMay 28, 2026

On Language Generation in the Limit with Bounded Memory

Jon Kleinberg, Anay Mehrotra, Amin Saberi, Grigoris Velegkas

The paper analyzes language generation and identification in the limit under bounded memory, showing that memory constraints significantly alter learnability, particularly affecting achievable density…

View →
cs.LGcs.AIRecentMay 28, 2026

The Little Book of Generative AI Foundations: An Intuitive Mathematical Primer

Tianhua Chen

This book provides a compact, derivation-oriented mathematical primer that connects major families of generative AI models, showing their underlying structural relationships.

View →
cs.ITcs.CRRecentMay 22, 2026

On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3

Namhun Koo, Soonhak Kwon, Minwoo Ko, Byunguk Kim

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

View →
math.HOcs.CRRecentMay 31, 2026

On the History of the Square and Multiply Algorithm

Nuh Aydin, Mohammad K. Azarian, Omid Khormali, Ghaya Mtimet

This paper traces the historical development of the square-and-multiply algorithm, arguing that while its conceptual foundation dates back to ancient Indian prosody, its formal articulation as a gener…

View →
cs.CRRecentMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

View →
cs.DMTheoreticalRecentJun 11, 2026

A Class of Multiparameter Signless Stirling Numbers of the First Kind and their $q$-Analogues

Violetta E. Piperigou, Malvina G. Vamvakari

This paper provides a probabilistic derivation of multiparameter signless Stirling numbers and their q-analogues.

View →
cs.DMTheoreticalRecentJun 11, 2026

Snake Polyominoes of Maximal Area in a Rectangle

Alexandre Blondin Massé, Alain Goupil

This paper presents an algorithm to generate snake-like polyominoes within a given rectangle and provides exact formulas for the maximal area of such polyominoes for certain dimensions.

View →
cs.AIRecentMay 28, 2026

Formalizing Mathematics at Scale

Ahmad Rammal, Niket Patel, Fabian Gloeckle, Amaury Hayat +4 more

The paper introduces AutoformBot, a multi-agent system that successfully autoformalizes a large corpus of open-access graduate-level mathematics textbooks into a verified library in Lean 4, demonstrat…

View →
cs.LGcs.AIRecentJun 1, 2026

Variational Learning for Insertion-based Generation

Yangtian Zhang, Zhe Wang, Arthur Gretton, Rex Ying +3 more

The paper introduces the Insertion Process (IP), a novel stochastic generative model that learns variable-length, non-monotonic sequence generation by explicitly modeling the insertion order of tokens…

View →
cs.CRRecentApr 17, 2026

Stringology Based Cryptology

Victor Kebande

This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…

View →
cs.CRRecentJun 4, 2026

GCD: Garbled, Corrected, Demonstrandum -- Fixing and Proving Go's Extended GCD Implementation

Linard Arquint

This paper fixes two subtle bugs in Go's extended GCD implementation, which is critical for RSA key generation, and formally proves the correctness and termination of the corrected code.

View →
cs.CRcs.CLRecentMay 4, 2026

FunFuzz: An LLM-Powered Evolutionary Fuzzing Framework

Mario Rodríguez Béjar, B. Romera-Paredes, Jose L. Hernández-Ramos

FunFuzz introduces a multi-island evolutionary fuzzing framework that uses LLMs to generate structured inputs, achieving superior compiler coverage and discovering more unique failures compared to exi…

View →