English
Related papers

Related papers: Limit-Cycle Replication via Chebyshev Pullbacks an…

200 papers

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

Data Structures and Algorithms · Computer Science 2020-04-21 Jan Kessler , Jens M. Schmidt

In this paper, we investigate the maximum number of limit cycles of the reduced Abel equation $\dot{x}=A(t)x^{3}+B(t)x^{2}$ on an interval $[0,T]$. The Smale-Pugh problem asks whether this maximum number is bounded in terms of a given class…

Classical Analysis and ODEs · Mathematics 2026-01-06 Jianfeng Huang , Renhao Tian , Yulin Zhao

In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials. First, following Han [2012] we develop a method to study…

Classical Analysis and ODEs · Mathematics 2015-06-03 Zhaoping Hu , Bin Gao , Valery G. Romanovski

In this paper, we continue the study of Maximally Recoverable (MR) Grid Codes initiated by Gopalan et al. [SODA 2017]. More precisely, we study codes over an $m \times n$ grid topology with one parity check per row and column of the grid…

Information Theory · Computer Science 2026-02-06 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

We prove an exponential separation in sample complexity between Euclidean and hyperbolic representations for learning on hierarchical data under standard Lipschitz regularization. For depth-$R$ hierarchies with branching factor $m$, we…

Machine Learning · Statistics 2026-01-29 Divit Rawal , Sriram Vishwanath

Limit cycles of planar polynomial vector fields have been an active area of research for decades; the interest in periodic-orbit related dynamics comes from Hilbert's 16th problem and the fact that oscillatory states are often found in…

Dynamical Systems · Mathematics 2022-01-11 Jose Mujica

We study virtual retracts in groups acting on rooted trees. We show that finitely generated branch groups do not have the local retraction (LR) property. Furthermore, we specialize to iterated monodromy groups of post-critically finite…

Group Theory · Mathematics 2026-01-26 Jorge Fariña-Asategui , Jon Merladet Urigüen

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…

Computational Complexity · Computer Science 2018-04-10 Suryajith Chillara , Christian Engels , Nutan Limaye , Srikanth Srinivasan

The orbits of the reversible differential system $\dot{x}=-y$, $\dot{y}=x$, $\dot{z}=0$, with $x,y \in R$ and $z\in R^d$, are periodic with the exception of the equilibrium points $(0,0, z)$. We compute the maximum number of limit cycles…

Dynamical Systems · Mathematics 2015-01-19 J. Llibre , M. A. Teixeira , I. O. Zeli

Let X be a homogeneous polynomial vector field of degree 2 on S^2. We show that if X has at least a non--hyperbolic singularity, then it has no limit cycles. We give necessary and sufficient conditions for determining if a singularity of X…

Dynamical Systems · Mathematics 2008-10-16 Jaume Llibre , Claudio Pessoa

We give algorithms with provable guarantees that learn a class of deep nets in the generative model view popularized by Hinton and others. Our generative model is an $n$ node multilayer neural net that has degree at most $n^{\gamma}$ for…

Machine Learning · Computer Science 2013-10-25 Sanjeev Arora , Aditya Bhaskara , Rong Ge , Tengyu Ma

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Computational Complexity · Computer Science 2015-11-10 V. Arvind , S. Raja

Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of $m$-variate polynomials. These codes allow for the design of high-rate codes that can recover every codeword or information symbol from many…

Information Theory · Computer Science 2021-10-12 Lukas Holzbaur , Rina Polyanskaya , Nikita Polyanskii , Ilya Vorobyev , Eitan Yaakobi

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Mathematical Physics · Physics 2020-01-29 Freddy Cachazo , Karen Yeats , Samuel Yusim

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

Computational Complexity · Computer Science 2022-12-27 Fulvio Gesmundo , Purnata Ghosal , Christian Ikenmeyer , Vladimir Lysikov

In the present paper, we study the number of zeros of the first order Melnikov function for piecewise smooth polynomial differential system, to estimate the number of limit cycles bifurcated from the period annulus of quadratic isochronous…

Classical Analysis and ODEs · Mathematics 2017-05-22 Xiuli Cen , Lijun Yang , Meirong Zhang

Assuming ZF and its consistency, we study some topological and geometrical properties of the symmetrized max-plus algebra in the absence of the axiom of choice in order to discuss the minimizing vector theorem for finite products of copies…

General Topology · Mathematics 2020-09-09 Cenap Özel , Artur Piękosz , Eliza Wajch , Hanifa Zekraoui

We present a new algorithm for finding isolated zeros of a system of real-valued functions in a bounded interval in $\mathbb{R}^n$. It uses the Chebyshev proxy method combined with a mixture of subdivision, reduction methods, and…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

Combinatorics · Mathematics 2023-08-24 John Byrne , Michael Tait
‹ Prev 1 3 4 5 6 7 10 Next ›