Results 101 to 110 of about 71,380 (295)
INTEGRAL MAJORIZATION POLYTOPES [PDF]
Discrete Mathematics, Algorithms and Applications, 2013 The majorization polytope M(a) consists of all vectors dominated (or majorized, to be precise) by a given vector a ∈ ℝn; this is a polytope with extreme points being the permutations of a. For integral vector a, let ν(a) be the number of integral vectors contained in M(a).
Zhang, Fuzhen, Dahl, Geir
openaire +3 more sources
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Mathematika, Volume 72, Issue 2, April 2026.Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Diameters and geodesic properties of generalizations of the associahedron [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The $n$-dimensional associahedron is a polytope whose vertices correspond to triangulations of a convex $(n + 3)$-gon and whose edges are flips between them. It was recently shown that the diameter of this polytope is $2n - 4$ as soon as $n > 9$.
C. Ceballos +3 more
doaj +1 more source
International Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 2907-2926, 25 March 2026.ABSTRACT This study presents a novel Distributed Robust Adaptive Model Predictive Control (DRAMPC) for tracking in multi‐agent systems. The framework is designed to work with dynamically coupled subsystems and limited communication, which is restricted to local neighborhoods.
Fabio Faliero +2 more
wiley +1 more source
Mathematical Methods in the Applied Sciences, Volume 49, Issue 4, Page 2135-2160, 15 March 2026.ABSTRACT It is an elementary fact in the scientific literature that the Lipschitz norm of the realization function of a feedforward fully connected rectified linear unit (ReLU) artificial neural network (ANN) can, up to a multiplicative constant, be bounded from above by sums of powers of the norm of the ANN parameter vector.
Arnulf Jentzen, Timo Kröger
wiley +1 more source
Polytope volume computation [PDF]
Mathematics of Computation, 1991 A combinatorial form of Gram's relation for convex polytopes can be adapted for use in computing polytope volume. We present an algorithm for volume computation based on this observation. This algorithm is useful in finding the volume of a polytope given as the solution set of a system of linear inequalities, P = {x E R': Ax < b} .
openaire +1 more source
ON PEDIGREE POLYTOPE AND ITS PROPERTIES
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2013 The fact that linear optimization over a polytope can be done in polynomial time in the input size of the instance, has created renewed interest in studying 0-1 polytopes corresponding to combinatorial optimization problems.
Tiru S. Arthanari
doaj +1 more source
Equivariant toric geometry and Euler–Maclaurin formulae
Communications on Pure and Applied Mathematics, Volume 79, Issue 3, Page 451-557, March 2026.Abstract We first investigate torus‐equivariant motivic characteristic classes of toric varieties, and then apply them via the equivariant Riemann–Roch formalism to prove very general Euler–Maclaurin‐type formulae for full‐dimensional simple lattice polytopes.
Sylvain E. Cappell +3 more
wiley +1 more source