English
Related papers

Related papers: Classifying All Degrees Below $N^3$

200 papers

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

Optimization and Control · Mathematics 2012-10-26 Tomáš Kepka , Miroslav Korbelář

The moduli space of degree $d$ morphisms on $\mathbb{P}^1$ has received much study. McMullen showed that, except for certain families of Latt\`es maps, there is a finite-to-one correspondence (over $\mathbb{C}$) between classes of morphisms…

Number Theory · Mathematics 2013-04-12 Benjamin Hutz , Michael Tepper

This paper presents a full catalogue, up to conjugacy and subgroups of finite index, of all matrix groups $H < {\rm GL}(3,\mathbb{R})$ that give rise to a continuous wavelet transform with associated irreducible quasi-regular…

Functional Analysis · Mathematics 2016-10-26 Bradley Currey , Hartmut Führ , Vignon Oussa

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).…

Logic · Mathematics 2015-07-01 Achim Blumensath , Bruno Courcelle

Let $\pi$ be a factor code from a one dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$. If $\pi$ is finite-to-one then the number of preimages of a typical point in $Y$ is an invariant called the degree of $\pi$. In…

Dynamical Systems · Mathematics 2014-04-10 Mahsa Allahbakhshi

Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…

Information Theory · Computer Science 2014-04-22 Vakhtang Lomadze

An automaton is partially ordered if the only cycles in its transition diagram are self-loops. The expressivity of partially ordered NFAs (poNFAs) can be characterized by the Straubing-Th\'erien hierarchy. Level 3/2 is recognized by poNFAs,…

Formal Languages and Automata Theory · Computer Science 2017-04-27 Tomáš Masopust , Markus Krötzsch

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

Probability · Mathematics 2019-07-25 Pierre Baldi , Roman Vershynin

In this article, we compute all possible degrees of maps between $S^3$-bundles over $S^5$. It also provides a correction of an article by Lafont and Neofytidis.

Algebraic Topology · Mathematics 2018-10-25 Xueqi Wang

Vector bundles and double vector bundles, or $2$-fold vector bundles, arise naturally for instance as base spaces for algebraic structures such as Lie algebroids, Courant algebroids and double Lie algebroids. It is known that all these…

Differential Geometry · Mathematics 2018-05-29 Elizaveta Vishnyakova

The complete classification of WZNW modular invariant partition functions is known for very few affine algebras and levels, the most significant being all levels of $A_1$ and $A_2$ and level 1 of all simple algebras. Here, we address the…

High Energy Physics - Theory · Physics 2009-10-28 Terry Gannon

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

Combinatorics · Mathematics 2010-01-01 Elad Haramaty , Amir Shpilka

The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…

Representation Theory · Mathematics 2016-07-11 Jürgen Müller

Deterministic two-way transducers capture the class of regular functions. The efficiency of composing two-way transducers has a direct implication in algorithmic problems related to reactive synthesis, where transformation specifications…

Formal Languages and Automata Theory · Computer Science 2024-07-01 Luc Dartois , Paul Gastin , Loïc Germerie Guizouarn , R. Govind , Shankaranarayanan Krishna

In [3] Borzellino and Brunsden started to develop an elementary differential topology theory for orbifolds. In this paper we carry on their project by defining a mapping degree for proper maps between orbifolds, which counts preimages of…

Geometric Topology · Mathematics 2019-07-05 Federica Pasquotto , Thomas O. Rot

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

Combinatorics · Mathematics 2025-05-09 Jason I. Brown , Ian C. George

This paper introduces a new automata-theoretic class of string-to-string functions with polynomial growth. Several equivalent definitions are provided: a machine model which is a restricted variant of pebble transducers, and a few inductive…

Formal Languages and Automata Theory · Computer Science 2023-03-24 Lê Thành Dũng Tito Nguyên , Camille Noûs , Cécilia Pradic

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…

Functional Analysis · Mathematics 2015-01-27 J. William Helton , J. E. Pascoe , Ryan Tully-Doyle , Victor Vinnikov

We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…

Commutative Algebra · Mathematics 2026-04-21 Maya Banks , Ritvik Ramkumar

The Amitsur-Levitski theorem asserts that $M_n(F)$ satisfies a polynomial identity of degree $2n$. (Here, $F$ is a field and $M_n(F)$ is the algebra of $n \times n$ matrices over $F$). It is easy to give examples of subalgebras of $M_n(F)$…

Rings and Algebras · Mathematics 2007-05-23 Daniel Birmajer