Results 91 to 100 of about 71,380 (295)
Newton Polytopes of Cluster Variables of Type $A_n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We study Newton polytopes of cluster variables in type $A_n$ cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon.
Adam Kalman
doaj +1 more source
Dynamic Event‐Triggered Robust Model Predictive Control for Quadrotor Trajectory Tracking
International Journal of Robust and Nonlinear Control, Volume 36, Issue 6, Page 3676-3688, April 2026.ABSTRACT This paper addresses the trajectory tracking problem for a full‐state quadrotor subject to physical model constraints and unknown external disturbances. A robust tube‐based model predictive control (MPC) approach is successfully applied to the system, which is subject to bounded disturbances and hard constraints.
Ali Can Erüst +2 more
wiley +1 more source
Root polytopes, flow polytopes, and order polytopes
39 pages, 13 figures, comments welcome!
Rietsch, Konstanze, Williams, Lauren
openaire +2 more sources
Random inscribing polytopes [PDF]
European Journal of Combinatorics, 2005 For convex bodies $K$ with $\mathcal{C}^2$ boundary in $\mathbb{R}^d$, we provide results on the volume of random polytopes with vertices chosen along the boundary of $K$ which we call $\textit{random inscribing polytopes}$. In particular, we prove results concerning the variance and higher moments of the volume, as well as show that the random ...
Ross M. Richardson, Van H. Vu, Lei Wu
openaire +4 more sources
Generating facets for the cut polytope of a graph by triangular elimination [PDF]
, 2006 The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science requires knowledge of
Avis, David +2 more
core +2 more sources
Characteristics of Complexity: Clique Number of a Polytope Graph and Rectangle Covering Number
Моделирование и анализ информационных систем, 2014 In the 1980s V.A. Bondarenko found that the clique number of the graph of a polytope in many cases corresponds to the actual complexity of the optimization problem on the vertices of the polytope.
A. N. Maksimenko
doaj +1 more source
Violation of all two-party facet Bell inequalities by almost-quantum correlations
Physical Review Research, 2021 The characterization of the set of quantum correlations is a problem of fundamental importance in quantum information. The question whether every proper (tight) Bell inequality is violated in quantum theory is an intriguing one in this regard.
Ravishankar Ramanathan
doaj +1 more source
Feynman polytopes and the tropical geometry of UV and IR divergences [PDF]
, 2022 Nima Arkani-Hamed +2 more
openalex +1 more source
Degree growth of monomial maps and McMullen's polytope algebra [PDF]
, 2010 We compute all dynamical degrees of monomial maps by interpreting them as mixed volumes of polytopes. By exploiting further the isomorphism between the polytope algebra of P. McMullen and the universal cohomology of complete toric varieties, we construct
C. Favre, Elizabeth Wulcan
semanticscholar +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source