English
Related papers

Related papers: On stable and fixed polynomials

200 papers

Let $N$ be a normal subgroup of a group $G$. An $N$-module $Q$ is $G$-stable provided that $Q$ is equivalent to the twist $Q^g$ of $Q$ by $g$, for every $g\in G$. If the action of $N$ on $Q$ extends to an action of $G$ on $Q$, $Q$ is…

Group Theory · Mathematics 2015-03-13 Brian Parshall , Leonard Scott

We study stability and bifurcations in holomorphic families of polynomial automorphisms of C^2. We say that such a family is weakly stable over some parameter domain if periodic orbits do not bifurcate there. We first show that this defines…

Dynamical Systems · Mathematics 2014-04-21 Romain Dujardin , Mikhail Lyubich

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

Logic · Mathematics 2015-09-24 Pierre Simon

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Christopher Ryba

We observe that stable integral simplicial volume of closed manifolds gives an upper bound for the rank gradient of the corresponding fundamental groups.

Geometric Topology · Mathematics 2017-04-19 Clara Loeh

Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…

Probability · Mathematics 2018-07-09 Zakhar Kabluchko , Hauke Seidel

We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…

We prove, in particular, that in a supersimple unidimensional theory the $SU$-rank is continuous and the $D$-rank is definable.

Logic · Mathematics 2014-12-19 Ziv Shami

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

In this note we consider the Steiner tree problem under Bilu-Linial stability. We give strong geometric structural properties that need to be satisfied by stable instances. We then make use of, and strengthen, these geometric properties to…

Data Structures and Algorithms · Computer Science 2021-09-29 James Freitag , Neshat Mohammadi , Aditya Potukuchi , Lev Reyzin

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

Data Structures and Algorithms · Computer Science 2016-10-04 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava

Let $f(x) \in K(x)$ be a quadratic polynomial where $K$ is a field of characteristic not equal to $2$. The associated arboreal Galois representation of the absolute Galois group of $K$ acts on a regular rooted binary tree. Boston and Jones…

Number Theory · Mathematics 2026-04-07 Özlem Ejder , Dilber Kocak

In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. In the case R is a Dedekind Q-algebra, some stronger results are obtained. A key element in the proof is a theorem…

Commutative Algebra · Mathematics 2012-04-20 Joost Berson , Arno van den Essen , David Wright

Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…

Data Structures and Algorithms · Computer Science 2015-01-26 Katarina Cechlarova , Tamas Fleiner , David F. Manlove , Iain McBride

We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…

Number Theory · Mathematics 2013-12-09 Allan J. MacLeod

We study the fixed points of the q-bracket on the complex unit disk, and prove the following. The set of (nontrivial) pairs (x,q) such that [x]_q=x form a manifold whose standard projections both have degree p-2. There is an analytic…

Number Theory · Mathematics 2011-07-14 Eric Brussel

We study K-stability of products of K-stable $\mathbb{Q}$-Fano varieties.

Algebraic Geometry · Mathematics 2016-10-18 Jihun Park , Joonyeong Won

We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…

Databases · Computer Science 2024-05-27 Anantha Padmanabha , Luc Segoufin , Cristina Sirangelo

We obtain two equivalent conditions for m polynomials in n variables to form a p-basis of a ring of constants of some polynomial K-derivation, where K is a UFD of characteristic p>0. One of these conditions involves jacobians, and the…

Commutative Algebra · Mathematics 2013-06-21 Piotr Jedrzejewicz

We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…

Rings and Algebras · Mathematics 2024-07-01 Miguel Couceiro , Erkko Lehtonen