◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Benjamin Braun

39 papers hereh-index 13530 citations60 works total

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

author position
  • sole author3
  • first author27
  • middle author7
  • last author2

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

fields
  • math.CO37
  • math.AC1
  • math.NT1
same name
  • Benjamin Braun — 3 papers, h 1
  • Benjamin Braun — 3 papers, h 1
  • Benjamin Braun — 3 papers, h 3
  • Benjamin Braun — 2 papers, h 6
  • Benjamin Braun — 1 paper, h 17
  • Benjamin Braun — 1 paper, h 2

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
20062026
most citedCounting Arithmetical Structures on Paths and Cycles

14 citations · 59 across the 29 of their papers we have counts for

collaborators
Showing 2022 · math.COShow all

4 papers · 2 filters

math.CO2022

Ehrhart Limits

Benjamin Braun, McCabe Olsen

We introduce the definition of an Ehrhart limit, that is, a formal power series with integer coefficients that is the limit in the ring of formal power series of a sequence of Ehrh…

math.CO2022★ 2 cited

Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering

Benjamin Braun, Kaitlin Bruegge, Matthew Kahle

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symm…

math.CO2022

Triangulations of Flow Polytopes, Ample Framings, and Gentle Algebras

Matias von Bell, Benjamin Braun, Kaitlin Bruegge +4

The cone of nonnegative flows for a directed acyclic graph (DAG) is known to admit regular unimodular triangulations induced by framings of the DAG. These triangulations restrict t…

math.CO2022★ 6 cited

Facets of Symmetric Edge Polytopes for Graphs with Few Edges

Benjamin Braun, Kaitlin Bruegge

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) givin…

◍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.