Results 121 to 130 of about 71,380 (295)
A tropical approach to rigidity: Counting realisations of frameworks
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
, 2020 We illustrate the limitations of the hyperplane separation bound, a non-combinatorial lower bound on the extension complexity of a polytope. Most notably, this bounding technique is used by Rothvo{\ss} (J ACM 64.6:41, 2017) to establish an exponential ...
Brugger, Matthias
core
On the moments of random variables uniformly distributed over a polytope
International Journal of Mathematics and Mathematical Sciences, 1997 Suppose X=(X1,X2,…,Xn) is a random vector uniformly distributed over a polytope. In this note, the author derives a formula for E(XirXjs…), (the expected value of XirXjs…), in terms of the extreme points of the polytope.
S. Paramasamy
doaj +1 more source
Toric amplitudes and universal adjoints
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley +1 more source
Gorenstein Fano polytopes arising from order polytopes and chain polytopes
, 2015 Richard Stanley introduced the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ arising from a finite partially ordered set $P$, and showed that the Ehrhart polynomial of $\mathcal{O}(P)$ is equal to that of $\mathcal{C}(P)$. In addition, the unimodular equivalence problem of $\mathcal{O}(P)$ and $\mathcal{C}(P)$ was studied by ...
Hibi, Takayuki +2 more
openaire +2 more sources
Some Notes about Arrangements of Points on Quadrics
Моделирование и анализ информационных систем, 2015 It is considered the minimization of a quadratic polynomial on the set of all points of a multidimensional space, coordinates of which are either zero or one. Some restrictions are imposed on the arrangement of the minimum points when there are many such
A. V. Seliverstov
doaj +1 more source
International Journal for Numerical Methods in Engineering, Volume 127, Issue 1, 15 January 2026.ABSTRACT Parametric model order reduction by matrix interpolation allows for efficient prediction of the behavior of dynamic systems without requiring knowledge about the underlying parametric dependency. Within this approach, reduced models are first sampled and then made consistent with each other by transforming the underlying reduced bases. Finally,
Sebastian Resch‐Schopper +2 more
wiley +1 more source
ALGORITHM OF DETERMINATION OF NON-STATIONARY NONLINEAR SYSTEMS FULL STABILITY AREAS
Российский технологический журнал, 2017 The paper proposes a numerical algorithm for constructing piecewise linear Lyapunov functions for investigating the absolute stability of nonlinear nonstationary systems.
V. P. Berdnikov
doaj +1 more source
Deadbeat Robust Model Predictive Control: Robustness Without Computing Robust Invariant Sets
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 428-438, 10 January 2026.ABSTRACT Deadbeat Robust Model Predictive Control (DRMPC) is introduced as a new approach of Robust Model Predictive Control (RMPC) for linear systems with additive disturbances. Its main idea is to completely extinguish the effect of the disturbances in the predictions within a small number of time steps, called the deadbeat horizon.
Georg Schildbach
wiley +1 more source
Journal of Algebraic Combinatorics, 2011 An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on the flags, such that adjacent flags belong to distinct orbits. Examples of chiral polytopes have been difficult to find. A "mixing" construction lets us combine polytopes to build new regular and chiral polytopes.
openaire +3 more sources