Invariants of binomial edge ideals via linear programs
From MaRDI portal
Linear programming (90C05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Combinatorial aspects of commutative algebra (05E40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ideals and multiplicative ideal theory in commutative rings (13A15) Characteristic (p) methods (Frobenius endomorphism) and reduction to characteristic (p); tight closure (13A35)
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 2134815 (Why is no real title available?)
- scientific article; zbMATH DE number 2212146 (Why is no real title available?)
- A procedure for computing the log canonical threshold of a binomial ideal
- About groups of straight lines
- An elementary computation of the F-pure threshold of an elliptic curve
- Binomial edge ideals and conditional independence statements
- Binomial edge ideals of bipartite graphs
- Binomial edge ideals: a survey
- Edge ideals: algebraic and combinatorial properties
- Gorenstein binomial edge ideals
- Graded ideals of König type
- Graphs and ideals generated by some 2-minors
- Linear and integer optimization. Theory and practice
- Log canonical thresholds of binomial ideals
- Matching theory
- Monomial Ideals
- Multiplier ideals of monomial ideals
- On F-pure thresholds
- Test, multiplier and invariant ideals
- The \(F\)-pure threshold of a determinantal ideal
- \(F\)-pure thresholds of binomial hypersurfaces
- F-purity versus log canonicity for polynomials
This page was built for publication: Invariants of binomial edge ideals via linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942647)
