English
Related papers

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

200 papers

We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…

Logic in Computer Science · Computer Science 2023-03-29 Vincent van Oostrom

Let $S$ be a domain and $R=S[t;\sigma,\delta]$ a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$ -derivation. We give criteria for skew polynomials $f\in R$ of degree less or equal to…

Rings and Algebras · Mathematics 2021-04-22 Christian Brown , Susanne Pumpluen

We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…

Combinatorics · Mathematics 2023-06-05 Eng Keat Hng

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

Letter-to-letter transducers are a standard formalism for modeling reactive systems. Often, two transducers that model similar systems differ locally from one another, by behaving similarly, up to permutations of the input and output…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Antonio Abu Nassar , Shaull Almagor

In this paper, we modify some previous definitions of fuzzy Turing machines to define the notions of accepting and rejecting degrees of inputs, computationally. We use a BFS-based search method and obtain an upper level bound to guarantee…

Logic in Computer Science · Computer Science 2017-07-19 Hadi Farahani

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $\theta:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$,…

Combinatorics · Mathematics 2021-07-09 Jack Allsop , Ian M. Wanless

Depth three and finite depth are notions known for subfactors via diagrams and Frobenius extensions of rings via centralizers in endomorphism towers. From the point of view of depth two ring extensions, we provide a clear definition of…

Rings and Algebras · Mathematics 2007-05-23 Lars Kadison

In this paper, we investigate nilpotent Lie algebras $ L $ of nilpotency class $3 $ and provide a complete classification of those satisfying $ \dim L^2 = 3 $ and $Z(L) = L^3 \cong A(2). $ Furthermore, we explicitly characterize the…

Group Theory · Mathematics 2025-11-25 Saboura Yousefi , Azam Kaheni , Farangis Johari

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…

Rings and Algebras · Mathematics 2024-02-07 A. Amparan , I. Baragaña , S. Marcaida , A. Roca

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…

Cryptography and Security · Computer Science 2022-06-02 Alessio Caminata , Elisa Gorla

This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…

Classical Analysis and ODEs · Mathematics 2021-08-26 Jeff Ledford

In this paper, we give a way to construct graded filtrations of graded modules. We then apply it to the Sally module, which describes a correction term of the Hilbert function. As a result, we obtain the inequality of the Hilbert…

Commutative Algebra · Mathematics 2021-10-11 Shinya Kumashiro

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…

Representation Theory · Mathematics 2014-07-11 E. Babson , B. Huisgen-Zimmermann , R. Thomas

We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states which are invariant under the SLOCC group $SL(2,{\mathbb C})^{4}$. From this description, we obtain a closed formula for the…

Quantum Physics · Physics 2013-02-12 J. -G. Luque , J. -Y. Thibon

We compute the sets of degrees of maps between principal $SU(2)$-bundles over $S^5$, i.e. between any of the manifolds $SU(2)\times S^5$ and $SU(3)$. We show that the Steenrod squares provide the only obstruction to the existence of a…

Algebraic Topology · Mathematics 2019-12-04 Jean-François Lafont , Christoforos Neofytidis

For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…

Number Theory · Mathematics 2022-09-09 Joachim König , Danny Neftin

A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…

Complex Variables · Mathematics 2017-04-04 Keisuke Uchimura

Subspace varieties are algebraic varieties whose elements are tensors with bounded multilinear rank. In this paper, we compute their degrees by computing their volumes.

Algebraic Geometry · Mathematics 2024-02-20 Paul Breiding , Pierpaola Santarsiero