Skip to content
DraconiticResearch
Search Sources API
182,549 studies31 sourcesUpdated 26 min ago
PreprintCC BY 4.0HAL

Ehrhart quasi-polynomials with finite abelian congruence constraints

  • Aleksander Zujev
  • Matthew Hudelson
Open at sourcePDFCite

Abstract

We study Ehrhart-type counting functions with finite abelian congruence constraints. Given a rational polytope P ⊂ R D , a finite abelian group A, a homomorphism ϕ : Z D → A, and an element c ∈ A, we consider

Related

  1. Fourier Decomposition and E-Eigenvalues of Hypergraph Polynomials over Finite Abelian Groups
    Yan-Hong Bao, Yi-Zheng Fan, Lili Liao
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
  2. Ehrhart polynomials of cyclic polytopes as averages of zonotope Ehrhart polynomials
    Masato Konoike
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Real-rooted Ehrhart h*-polynomials of crown posets and wheel and whirl matroids
    Ying Cao, Houshan Fu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. On the magic positivity of the Ehrhart polynomials of dilated base polytope of minimal matroid
    Jiaxuan Chen, Chance Crigler, Shengtao Ding +2
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Real-rootedness and ultra log-concavity of rank-two matroid Ehrhart h*-polynomials
    Houshan Fu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{zujev2026ehrhart,
  title = {{Ehrhart quasi-polynomials with finite abelian congruence constraints}},
  author = {Aleksander Zujev and Matthew Hudelson},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://hal.science/hal-05744708v1},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Ehrhart quasi-polynomials with finite abelian congruence constraints
AU  - Aleksander Zujev
AU  - Matthew Hudelson
PY  - 2026
DA  - 2026/09/10
PB  - HAL
UR  - https://hal.science/hal-05744708v1
AB  - We study Ehrhart-type counting functions with finite abelian congruence constraints. Given a rational polytope P ⊂ R D , a finite abelian group A, a homomorphism ϕ : Z D → A, and an element c ∈ A, we consider
ER  -