This repository contains the source code related to the book Optical Wireless Communications System and Channel Modelling with MATLAB. Some of the original code had issues and required modifications. I have made the necessary adjustments to enhance practicality and functionality.
短信轰炸、短信压测、完整源码、仅供自己测试使用，感谢Start🌟
This project provides a web-based Optical Character Recognition (OCR) scanner. It uses a FastAPI backend with PaddleOCR for text detection and recognition, and a simple HTML/Vue.js frontend.
This repo collects a small Wolfram Language toolkit implementing the key formulas from the paper "The 1/4-phenomenon of placement probabilities of tilings in the Aztec diamond" about placement probabilities and creation rates in Aztec diamonds.
This package implements the BiSC algorithm from the research paper "BiSC: An algorithm for discovering generalized permutation patterns" by Henning Ulfarsson. The algorithm automatically discovers forbidden patterns in sets of permutations, bridging computer science and mathematics through automated conjecture.
This repository builds switching rook polynomials, rook numbers, and Hilbert–Poincaré series for convex collections of cells that satisfy Condition (#) or its reflection (#').
Wolfram Language utilities to compute Schubert polynomials, check the pattern-avoidance criterion ($1432$, $1423$, $4132$, $3142$), and build the predicted elementary-symmetric factorization.
Mathematica implementation of the partition families $A_k(n)$, $B_k(n)$, $E_k(n)$, $C_k(n)$, $B'_k(n)$ and the stratified subsets $B'_{k,i}(n)$, $C_{k,i}(n)$ along with the bijections $\psi$, $\phi$, and Glaisher’s map between $A_k$ and $B_k$ from the reference paper "Generalizations of Euler's Theorem to $k$-regular partitions".
This project focuses on enumerating $n$-ary words that avoid either strictly increasing streaks of length $k$ or their non-decreasing (``soft'') counterparts, together with expected waiting times and asymptotic formulas that appear in the paper "Counting words without strictly increasing subwords of fixed length".
This repository contains a Wolfram Language implementation of the algorithm sketched in "Computing parametric weighted Ehrhart polynomials of smooth polytopes".
Implementation of the constructions outlined in the paper "Polynomial identities for quivers via incidence algebras".
This repository implements the constructions from the paper "A combinatorial formula for Interpolation Macdonald polynomials" in the Wolfram Language.
Implements the recurrence and Binet machinery for generalized Fibonacci polynomials (GFP) described in the paper "Zeros and Orthogonality of generalized Fibonacci polynomials".
This project provides a Wolfram Language implementation of the combinatorial Hodge theory constructions developed in "Hodge theory for combinatorial geometries".
This repository contains a Wolfram Language implementation of the higher order $r$-Dowling polynomials introduced in the paper "Higher Order $r$-Dowling polynomials".
This project implements the Horton-Strahler (register) analysis for binary butterfly trees, following the derivations in `reference_paper/glue-register.tex`. The core Wolfram Language packages cover both structural tree utilities and the closed-form generating functions that emerge from the paper.
This project implements a collection of Wolfram Language utilities inspired by the reference paper "Non symmetric Cauchy kernel, crystals and last passage percolation"
Ariki--Koike multipartitions utilities implemented in Wolfram Language.
This workspace implements the explicit Kostka-Foulkes polynomials described in Lecouvey's *Combinatorics of crystal graphs and Kostka-Foulkes polynomials* for the classical types $B_n$, $C_n$, and $D_n$ when $|\lambda| \leq 3$, together with the closed expressions for $B_2=C_2$ at weight $\mu=0$.
Implementation of the mathematical framework from the paper: "Hall-Littlewood polynomials, affine Schubert series, and lattice enumeration"
Implementation of the mathematical concepts from the paper "A note on Combinatorial Invariance of Kazhdan-Lusztig polynomials" by Francesco Esposito, Mario Marietti, Grant T. Barkley, and Christian Gaetz (arXiv:2404.12834v3).
Python implementation of the mathematical structures and bijections from the paper: "Interlacing triangles, Schubert puzzles, and graph colorings" by Christian Gaetz and Yibo Gao arXiv:2408.07863v2
Implementation of mathematical formulas from the paper: "Positivity of permutation pattern character polynomials"
This implementation is based on the paper "q-Whittaker polynomials: bases, branching and direct limits" and provides a comprehensive Mathematica package for computing q-Whittaker polynomials and their associated statistics.
Implementation of formulas from the paper "Probabilistic operators for non-attacking tableaux and a compact formula for the symmetric Macdonald polynomials".
Implementation of algorithms and theorems from the paper "Newton polytopes of dual $k$-Schur polynomials"
Implementation of the paper "Polynomial representation of TU-games" by Ulrich Faigle and Michel Grabisch in Wolfram Language.
Mathematica implementation of concepts from the paper "General Position Polynomials".
This repository contains a Mathematica (Wolfram Language) implementation of the domination polynomial for rook graphs, based on the paper: "Domination Polynomial of the Rook Graph"
A complete Python implementation of the linear-time algorithm for computing the strong vertex span of trees, based on the research paper "The strong vertex span of trees".