Related papers: On the Combinatorial Rigidity for Polynomials with…

The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…

This work contains the results from a comprehensive study of a new class of attractors. The attractors in this class are characterized by strong local instability, but they are not uniformly hyperbolic. Rigorous results on their dynamical,…

In this paper we will consider the 2-fold symmetric complex hyperbolic triangle groups generated by three complex reflections through angle 2pi/p with p no smaller than 2. We will mainly concentrate on the groups where some elements are…

In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these…

We prove that the arc complex of a polygon with a marked point in its interior is a strongly collapsible combinatorial ball. We also show that the arc complex of a M\"{o}bius strip, with finitely many marked points on its boundary, is a…

We classify here combinatorially rigid simple polytopes with three facets more than their dimension.

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

In this paper, we study heterodimensional cycles of two-parameter families of 3-dimensional diffeomorphisms some element of which contains nondegenerate heterodimensional tangencies of the stable and unstable manifolds of two saddle points…

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

We show that if a H\"{o}lder continuous linear cocycle over a hyperbolic system is measurably conjugate to a cocycle taking values in a unipotent group, then the cocycle is H\"older continuously conjugate to a cocycle taking values in a…

Let $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. Determining toughness is an NP-hard problem for arbitrary…

We consider infinitely renormalizable Lorenz maps with real critical exponent $\alpha>1$ and combinatorial type which is monotone and satisfies a long return condition. For these combinatorial types we prove the existence of periodic points…

We show that an invariant Fatou component of a hyperbolic transcendental entire function is a bounded Jordan domain (in fact, a quasidisc) if and only if it contains only finitely many critical points and no asymptotic curves. We use this…

It is known that sectional-hyperbolic attracting sets, for a $C^2$ flow on a finite dimensional compact manifold, have at most finitely many ergodic physical invariant probability measures. We prove an upper bound for the number of distinct…

For a rational function $R$, let $N_R(z)=z-\frac{R(z)}{R'(z)}.$ Any such $N_R$ is referred to as a Newton map. We determine all the rational functions $R$ for which $N_R$ has exactly two attracting fixed points, one of which is an…

Under the assumption that the X-ray transform over symmetric solenoidal 2-tensors is injective, we prove that smooth compact connected manifolds with strictly convex boundary, no conjugate points and a hyperbolic trapped set are locally…

We study the dynamics of billiard models with a modified collision rule: the outgoing angle from a collision is a uniform contraction, by a factor lambda, of the incident angle. These pinball billiards interpolate between a one-dimensional…

We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…

We consider univariate real polynomials with all roots real and with two sign changes in the sequence of their coefficients which are all non-vanishing. One of the changes is between the linear and the constant term. By Descartes' rule of…