Delorme
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
Announce Type: replace Abstract: The Cutting Stock Problem (CSP) and Bin Packing Problem (BPP) are classical combinatorial optimization problems extensively studied since the 1960s. State-of-the-art exact algorithms are based on set-cover and arc-flow models whose linear relaxation, rounded up, matches the integer optimum for most benchmark instances, a condition known as the Integer Round-up Property (IRUP). In 2016, Delorme et al. showed that all existing instances could be solved within...
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
arXiv:2507.22597v2 Announce Type: replace-cross Abstract: We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to one. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre-like bound holds with equality for weighted projective spaces when the first weight is one, and when considering polynomials whose...