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

20 results for “Catalan numbers”

CS papers only

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

Want pure semantic search? Try claim verification →

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.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.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.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 →
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.ARcs.MSRecentJun 3, 2026

GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF256 with a Lucas-Exact Integer Identity

Dmitrii Vasiliev

This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.

View →
cs.DMcs.CGTheoreticalRecentJun 11, 2026

On the Counting Sequence of Z-convex Polyominoes

Luca Castelli, Paolo Massazza

This paper presents a set of formulas and equations to compute the longest counting sequence of convex polyominoes of degree of convexity at most 2.

View →
cs.FLcs.CLcs.LGRecentJun 1, 2026

An Algebraic View of the Expressivity of Recurrent Language Models

Franz Nowak, Ryan Cotterell, Reda Boumasmoud

The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…

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 →
math.NTcs.CRRecentMar 26, 2026

Second order Recurrences, quadratic number fields and cyclic codes

Minjia Shi, Xuan Wang, Bouazzaoui Zakariae, Jon-Lark Kim +1 more

The paper investigates generalized Wall-Sun-Sun primes, $WSS(d)$, and uses them to study the weight distributions of specific cyclic codes defined over $ ext{F}_p$ and $ ext{Z}_{p^2}$.

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.DScs.CCq-bio.PERecentMay 29, 2026

Tree Containment Parameterized by Scanwidth

Leo van Iersel, Mark Jones, Mathias Weller

This paper develops a parameterized algorithm for the NP-complete Tree Containment problem, showing it can be solved efficiently based on a structural parameter called scanwidth.

View →
cs.CRcs.ITquant-phRecentApr 24, 2026

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

Ming-Xing Luo

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

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.CRcs.CYRecentApr 26, 2026

Analysis of Personal Data Exposure in Thailand

Suphannee Sivakorn, Sasawat Malaivongs, Nuttaya Rujiratanapat

This study analyzed the online exposure of Thai National Identification Numbers and other sensitive personal data, revealing over 1.2 million records, primarily originating from government websites, w…

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 →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

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.AIcs.CLRecentApr 7, 2026

Swiss-Bench 003: Evaluating LLM Reliability and Adversarial Security for Swiss Regulatory Contexts

Fatih Uenal

This paper introduces Swiss-Bench 003, an expanded evaluation framework assessing LLM reliability and adversarial security across eight dimensions using 808 Swiss-specific items, revealing that self-g…

View →
cs.CRcs.ITRecentApr 20, 2026

Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

Freddy Lendé Metouké, Hervé Talé Kalachi, Hermann Tchatchiem Kamche, Ousmane Ndiaye +1 more

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

View →