English
Related papers

Related papers: Li\'{e}nard's system and Smale's problem

200 papers

We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…

Data Structures and Algorithms · Computer Science 2019-07-19 Nikhil Bansal

We show that a recently introduced generalized scheme of quantum mechanics has connections to Li\'{e}nard and Levinson-Smith classes of nonlinear systems. For the Li\'{e}nard type, which has coefficients of odd and odd symmetry, we…

Quantum Physics · Physics 2026-03-31 Bijan Bagchi , Anindya Ghose-Choudhury

The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…

Group Theory · Mathematics 2022-04-29 Zinovy Reichstein

This paper deals with the finite-time stabilization of a class of nonlinear infinite-dimensional systems. First, we consider a bounded matched perturbation in its linear form. It is shown that by using a set-valued function, both the…

Systems and Control · Electrical Eng. & Systems 2025-09-03 Kamal Fenza , Moussa Labbadi , Mohamed Ouzahra

Smale's alpha-theory certifies that Newton iterations will converge quadratically to a solution of a square system of analytic functions based on the Newton residual and all higher order derivatives at the given point. Shub and Smale…

Numerical Analysis · Mathematics 2016-04-06 Jonathan D. Hauenstein , Viktor Levandovskyy

Generalized Tur\'an problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain…

Combinatorics · Mathematics 2024-03-01 Debsoumya Chakraborti , Da Qi Chen

We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixed index order) leads to a…

Optimization and Control · Mathematics 2010-06-24 Jan Foniok , Komei Fukuda , Bernd Gärtner , Hans-Jakob Lüthi

The solution of the global controllability problem is obtained for a class of the triangular systems of O.D.E. that are not feedback linearizable. The introduced class is a generalization of the classes of triangular systems investigated…

Optimization and Control · Mathematics 2007-05-23 Valery I. Korobov , Svyatoslav S. Pavlichkov

We study time-reversal symmetry in dynamical systems with finite phase space, with applications to birational maps reduced over finite fields. For a polynomial automorphism with a single family of reversing symmetries, a universal (i.e.,…

Dynamical Systems · Mathematics 2015-05-13 John A. G. Roberts , Franco Vivaldi

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

Optimization and Control · Mathematics 2019-12-20 Saman Khoramian

This paper considers the length of resolution proofs when using Krishnamurthy's classic symmetry rules. We show that inconsistent linear equation systems of bounded width over a fixed finite field $\mathbb{F}_p$ with $p$ a prime have, in…

Computational Complexity · Computer Science 2021-01-14 Pascal Schweitzer , Constantin Seebach

The problem of finding a maximum $2$-matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalized to finding a maximum $t$-matching which excludes specified…

Combinatorics · Mathematics 2023-11-01 Yuni Iwamasa , Yusuke Kobayashi , Kenjiro Takazawa

We provide sharp lower bounds for the multiplicity of a local holomorphic foliation defined in a complex surface in terms of data associated to a germ of invariant curve. Then we apply our methods to invariant curves whose branches are…

Complex Variables · Mathematics 2023-10-23 Pedro Fortuny Ayuso , Javier Ribón

In this paper we obtain sharp results for Waring's problem over general finite rings, by using a combination of Artin-Wedderburn theory and Hensel's lemma and building on new proofs of analogous results over finite fields that are achieved…

Number Theory · Mathematics 2017-09-14 Yeşim Demiroğlu Karabulut

We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…

Data Structures and Algorithms · Computer Science 2013-12-24 Boaz Barak , Jonathan Kelner , David Steurer

The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…

Algebraic Geometry · Mathematics 2010-03-02 Elisa Postinghel

In this paper we describe six pencils of K3-surfaces which have large Picard-Number and contain precisely five singular fibers: four have A-D-E singularities and one is non-reduced. In particular we describe these surfaces as cyclic…

Algebraic Geometry · Mathematics 2007-05-23 Alessandra Sarti

We study the Poincare-Bendixson theorem for two-dimensional continuous dynamical systems in compact domains from the point of view of computation, seeking algorithms for finding the limit cycle promised by this classical result. We start by…

Computational Complexity · Computer Science 2015-11-25 Christos H. Papadimitriou , Nisheeth K. Vishnoi

The main result of this paper is the construction of infinitely many conserved quantities (corresponding to commuting transfer-matrices) for the limit shape equation for the 6-vertex model on a cylinder. This suggests that the limit shape…

Mathematical Physics · Physics 2015-10-06 Nicolai Reshetikhin , Ananth Sridhar

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas