kth.sePublications KTH
Change search
Link to record
Permanent link

Direct link
Leite, Leonardo Saud MaiaORCID iD iconorcid.org/0000-0001-9290-9796
Alternative names
Publications (3 of 3) Show all publications
Lundstrom, T. & Leite, L. S. (2026). Order polytopes of crown posets. European journal of combinatorics (Print), 133, Article ID 104304.
Open this publication in new window or tab >>Order polytopes of crown posets
2026 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 133, article id 104304Article in journal (Refereed) Published
Abstract [en]

In the last decade, the order polytope of the zigzag poset has been thoroughly studied. A related poset, called crown poset, obtained by adding an extra cover relation between the endpoints of an even zigzag poset, is not so well understood. In this paper, we study the order polytopes of crown posets. We provide explicit formulas for their f-vectors. We provide recursive formulas for their Ehrhart polynomial, giving a counterpart to formulas found in the zigzag case by Petersen and Zhuang (2025). We use these formulas to simplify a computation by Ferroni, Morales and Panova (2025) of the linear term of the order polynomial of these posets. Furthermore, we provide a combinatorial interpretation for the coefficients of the h & lowast;-polynomial in terms of the cyclic swap statistic on cyclically alternating permutations, which provides a circular version of a result by Coons and Sullivant (2023).

Place, publisher, year, edition, pages
Elsevier BV, 2026
National Category
Discrete Mathematics
Identifiers
urn:nbn:se:kth:diva-377275 (URN)10.1016/j.ejc.2025.104304 (DOI)001638175100001 ()2-s2.0-105024104991 (Scopus ID)
Note

QC 20260224

Available from: 2026-02-24 Created: 2026-02-24 Last updated: 2026-02-24Bibliographically approved
Bränden, P. & Leite, L. S. (2026). Totally nonnegative matrices, chain enumeration and zeros of polynomials. Advances in Mathematics, 487, Article ID 110760.
Open this publication in new window or tab >>Totally nonnegative matrices, chain enumeration and zeros of polynomials
2026 (English)In: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 487, article id 110760Article in journal (Refereed) Published
Abstract [en]

We prove that every lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for chain enumeration in posets and zeros of chain polynomials. The results obtained extend and unify results of the first author, Brenti, Welker and Athanasiadis. In the process we define a notion of h -vector for a large class of posets which generalize the notions of h -vectors associated to simplicial and cubical complexes. A consequence of our methods is a characterization of the convex hull of all characteristic polynomials of hyperplane arrangements of fixed dimension and over a fixed finite field. This may be viewed as a refinement of the Critical Problem of Crapo and Rota. We also use the methods developed to solve an open problem posed by Forgács and Tran on the real-rootedness of polynomials arising from certain bivariate rational functions.

Place, publisher, year, edition, pages
Elsevier BV, 2026
Keywords
Chain polynomial, r-cubical poset, Real-rooted polynomial, Shellability, The Critical Problem, Totally nonnegative matrix
National Category
Discrete Mathematics
Identifiers
urn:nbn:se:kth:diva-375691 (URN)10.1016/j.aim.2025.110760 (DOI)2-s2.0-105026686868 (Scopus ID)
Note

QC 20260120

Available from: 2026-01-20 Created: 2026-01-20 Last updated: 2026-01-20Bibliographically approved
Araújo De Medeiros, D., Williams, J. J., Wahlgren, J., Saud Maia Leite, L. & Peng, I. B. (2025). ARC-V: Vertical Resource Adaptivity for HPC Workloads in Containerized Environments. In: 31st International European Conference on Parallel and Distributed Computing: . Paper presented at The 31st International European Conference on Parallel and Distributed Computing (Euro-Par ’25), Dresden, Germany, 25-29 Aug, 2025. Springer Nature
Open this publication in new window or tab >>ARC-V: Vertical Resource Adaptivity for HPC Workloads in Containerized Environments
Show others...
2025 (English)In: 31st International European Conference on Parallel and Distributed Computing, Springer Nature , 2025Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer Nature, 2025
Keywords
Vertical scaling, HPC workloads, Cloud Computing, Resource Adaptivity, Memory Resource Provisioning
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Computer Science
Identifiers
urn:nbn:se:kth:diva-363170 (URN)10.1007/978-3-031-99854-6_12 (DOI)2-s2.0-105015430232 (Scopus ID)
Conference
The 31st International European Conference on Parallel and Distributed Computing (Euro-Par ’25), Dresden, Germany, 25-29 Aug, 2025
Note

QC 20250923

Available from: 2025-05-06 Created: 2025-05-06 Last updated: 2025-09-23Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0001-9290-9796

Search in DiVA

Show all publications