Related papers: Self-inversive polynomials, curves, and codes
We provide sharp lower bounds for the multiplicity of a local holomorphic foliation defined in a complex surface in terms of data associated to a germ of invariant curve. Then we apply our methods to invariant curves whose branches are…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
For $p$ an odd prime number, $q_{0}=p^{t}$, and $q=p^{2t-1}$, let $\mathcal{X}_{\mathcal{G}_{\mathcal{S}}}$ be the nonsingular model of $$ Y^{q}-Y=X^{q_{0}}(X^{q}-X). $$ In the present work, the number of $\mathbb{F}_{q^{n}}$-rational…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindromic circuits. We precisely determine which self-inverse…
In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…
We study the groups of automorphisms of rational algebraic surfaces that admit a relatively minimal pencil of curves of arithmetic genus one over an algebraically closed field of arbitrary characteristic. In particular, we classify such…
In this paper, we study non-hyperelliptic curves of genus $3$ with cyclic automorphism group of order $6$. Over an algebraically closed field $K$ of characteristic $\neq 2,3$, such curves are written as plane quartics $C_r: x^3 z + y^4 + r…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
We study projectively self-dual polygons and curves in the projective plane. Our results provide a partial answer to problem No 1994-17 in the book of Arnold's problems.
It is well known that every finite subgroup of automorphism group of polynomial algebra of rank 2 over the field of zero characteristic is conjugated with a subgroup of linear automorphisms. We prove that it is not true for an arbitrary…
We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…
We introduce a refined version of group cohomology and relate it to the space of polynomials on the group in question. We show that the polynomial cohomology with trivial coefficients admits a description in terms of ordinary cohomology…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…
In this note, we introduce the notion of an unramified strongly cyclic covering for a cyclic curve, a class that has similar properties to, and contains, unramified double covers of hyperelliptic curves. We determine several of their basic…
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…