◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yining Hu

13 papers hereh-index 131.6k citations43 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author5
  • middle author3
  • last author1

Across the 12 of 13 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • cs.CR2
  • cs.CY2
  • math.NT2
  • cs.DC1
  • cs.SI1
same name
  • Yining Hu — 4 papers
  • Yining Hu — 2 papers
  • Yining Hu — 1 paper, h 14
  • Yining Hu — 1 paper
  • Yining Hu — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20162022
most citedCharacterizing and Detecting Money Laundering Activities on the Bitcoin Network

46 citations · 66 across the 7 of their papers we have counts for

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO2019

On the automaticity of sequences defined by continued fractions

Guoniu Han, Yining Hu

Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory…

math.CO2018

On the automaticity of the Hankel determinants of a family of automatic sequences

Yining Hu, Guoniu Wei-Han

Hankel determinants and automatic sequences are two classical subjects widely studied in Mathematics and Theoretical Computer Science. However, these two topics were considered tot…

math.CO2017

On the Union-Closed Sets Conjecture

Yining Hu

Several results about the union-closed sets conjecture are presented.

math.CO2016

Combinatorial proof of the transcendence of L(1,χs​)/Π

Yining Hu

We give a combinatorial proof of the transcendence of L(1,χs​)/Π, where L(1,χs​) (resp. Π) is the analogue in characteristic p of the function L of Dirichlet (resp. π).…

math.CO2016

Subword Complexity and (non)-automaticity of certain completely multiplicative functions

Yining Hu

In this article, we prove that for a completely multiplicative function f from N∗ to a field K such that the set $$\{p \;|\; f(p)\neq 1_K \;\mbox{and }p \mbox{ is p…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.