English
Related papers

Related papers: A Complementarity Partition Theorem for Multifold …

200 papers

Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…

Optimization and Control · Mathematics 2010-06-28 Philipp Rostalski , Bernd Sturmfels

We study the iterated blow-up X of projective space along an arbitrary collection of linear subspaces. By replacing the universal torsor with an $\mathbb{A}^1$-homotopy equivalent model, built from $\mathbb{A}^1$-fiber bundles not just…

Algebraic Geometry · Mathematics 2014-01-06 Brent Doran , Noah Giansiracusa

A (2+1)-dimensional quasilinear system is said to be `integrable' if it can be decoupled in infinitely many ways into a pair of compatible n-component one-dimensional systems in Riemann invariants. Exact solutions described by these…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 E. V. Ferapontov , K. R. Khusnutdinova

Michael's selection theorem implies that a closed convex nonempty-valued mapping from the Sorgenfrey line to a euclidean space is inner semicontinuous if and only if the mapping can be represented as the image closure of right-continuous…

Optimization and Control · Mathematics 2022-04-12 Ari-Pekka Perkkiö , Erick Treviño-Aguilar

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…

Combinatorics · Mathematics 2023-10-31 Darlison Nyirenda , Molatelo Rapudi

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…

Discrete Mathematics · Computer Science 2011-11-17 Wenqi Huang , Tao Ye , Duanbing Chen

A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…

Combinatorics · Mathematics 2016-01-27 Armin Straub

It is shown that every measurable partition ${A_1,..., A_k}$ of $\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i} xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the partition of $\mathbb{R}^2$ into $120^\circ$…

Computational Complexity · Computer Science 2014-04-08 Steven Heilman , Aukosh Jagannath , Assaf Naor

In the first part of this article, we study linear cones over totally ordered fields. We show that for each such cone there uniquely exists a universal vector space (called its spanned vector space) into which it embeds as a generating…

Metric Geometry · Mathematics 2025-08-26 Ethan Kharitonov , Argam Ohanyan

Let $(X, \Delta)/U$ be klt pairs and $Q$ be a convex set of divisors. Assuming that the relative Kodaira dimensions are non-negative, then there are only finitely many log canonical models when the boundary divisors varying in a relatively…

Algebraic Geometry · Mathematics 2020-06-03 Zhan Li

An infinite integer matrix A is called image partition regular if, whenever the natural numbers are finitely coloured, there is an integer vector x such that Ax is monochromatic. Given an image partition regular matrix A, can we also insist…

Combinatorics · Mathematics 2013-12-20 Ben Barber , Imre Leader

We obtain partition regularity results for homogeneous quadratic equations whose parametrized solutions admit nice factorizations into linear forms over rings of integers of imaginary quadratic fields. To do so, we develop number-theoretic…

Combinatorics · Mathematics 2026-04-08 Sebastián Donoso , Andreu Ferré Moragues , Andreas Koutsogiannis , Wenbo Sun

We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…

For an ideal $I_{m,n}$ generated by all square-free monomials of degree $m$ in a polynomial ring $R$ with $n$ variables, we obtain a specific embedding of a canonical module of $R/I_{m,n}$ to $R/I_{m,n}$ itself. The construction of this…

Commutative Algebra · Mathematics 2017-04-12 Ela Celikbas , Jai Laxmi , Jerzy Weyman

We prove a Lagrangian analogue of the Conley conjecture: given a 1-periodic Tonelli Lagrangian with global flow on a closed configuration space, the associated Euler-Lagrange system has infinitely many periodic solutions. More precisely, we…

Dynamical Systems · Mathematics 2010-12-07 Marco Mazzucchelli

We consider a planar Hamiltonian system of the type $Jz' = \nabla_z H(t,z)$, where $H: \mathbb{R} \times \mathbb{R}^2 \to \mathbb{R}$ is a function periodic in the time variable, such that $\nabla_z H(t,0) \equiv 0$ and $\nabla_z H(t,z)$ is…

Classical Analysis and ODEs · Mathematics 2022-03-08 Alberto Boscaggin , Eduardo Muñoz-Hernández

The purpose of this paper is to prove a new, more general version of the Morse index theorem for heteroclinic, homoclinic, and half-clinic solutions in general Lagrangian systems. In the final section, we compute the Morse index for…

Dynamical Systems · Mathematics 2025-12-17 Xijun Hu , Alessandro Portaluri , Li Wu , Qin Xing

Two independent sets of a graph are adjacent if they differ on exactly one vertex (i.e. we can transform one into the other by adding or deleting a vertex). Let $k$ be an integer. We consider the reconfiguration graph $TAR_k(G)$ on the set…

Discrete Mathematics · Computer Science 2014-06-06 Marthe Bonamy , Nicolas Bousquet

We develop a theory for the multiple radial $\mathrm{SLE}(\kappa)$ systems with parameter $\kappa > 0$ -- a family of random multi-curve systems in a simply connected domain $\Omega$, with marked boundary points $z_1, \ldots, z_n \in…

Probability · Mathematics 2025-10-09 Jiaxin Zhang

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

Computer Vision and Pattern Recognition · Computer Science 2011-12-06 Jan Lellmann , Frank Lenzen , Christoph Schnörr