On the public citation graph

Euler's Ëxemplum Memorabile Inductionis Fallacis" and q-Trinomial Coefficients

0 signed · 19 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4660475openalex-extracted
Matched Dispatching in Randomized Settings
inferred← citeshttps://doi.org/10.1007/978-3-030-05411-3_45openalex-snapshot
New Deterministic Model of Evolving Trinomial Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_13-1openalex-snapshot
Proofs, Arbitrary Exemplifications, and Inductive Generalizations in Euler’s Mathematical Practice
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_13-2openalex-snapshot
Proofs, Arbitrary Exemplifications, and Inductive Generalizations in Euler’s Mathematical Practice
inferred← citeshttps://doi.org/10.1007/978-3-031-40846-5_13openalex-snapshot
Proofs, Arbitrary Exemplifications, and Inductive Generalizations in Euler’s Mathematical Practice
inferred← citeshttps://doi.org/10.1007/s41109-019-0217-1openalex-snapshot
About complexity of complex networks
inferred← citeshttps://doi.org/10.1016/j.aam.2008.07.003openalex-snapshot
Bilateral Bailey lemma and Rogers–Ramanujan identities
inferred← citeshttps://doi.org/10.1016/j.amc.2018.07.028openalex-snapshot
On the lacunary sum of trinomial coefficients
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112415openalex-snapshot
Trinomial coefficients, Fibonacci numbers and units of the group U(ZCp)
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.10.005openalex-snapshot
A truncated Jacobi triple product theorem
inferred← citeshttps://doi.org/10.1016/j.jsc.2003.04.002openalex-snapshot
RRtools—a Maple package for aiding the discovery and proof of finite Rogers–Ramanujan type identities
inferred← citeshttps://doi.org/10.1016/j.spl.2010.02.019openalex-snapshot
On the density of the sum of two independent Student t -random vectors
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00047-5openalex-snapshot
The generalized Borwein conjecture. II. Refined q-trinomial coefficients
inferred← citeshttps://doi.org/10.1080/00150517.2005.12428353openalex-snapshot
Polynomial generalizations of the Pell sequences and the Fibonacci sequence
inferred← citeshttps://doi.org/10.1119/5.0061383openalex-snapshot
Exploring entropy by counting microstates of the p-state paramagnet
inferred← citeshttps://doi.org/10.37236/1706openalex-snapshot
Finite Rogers-Ramanujan Type Identities
inferred← citeshttps://doi.org/10.4064/cm139-1-8openalex-snapshot
Some congruences involving binomial coefficients
inferred← citeshttps://doi.org/10.46298/dmtcs.2996openalex-snapshot
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
inferred← citeshttps://doi.org/10.7546/crabs.2022.04.03openalex-snapshot
Polynomial and Multinomial Coefficients in Terms of Number of Shortest Paths
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.