Related papers: Computing odd periods of alternating systems of af…
In this article, we construct algebraic equations for a curve C and a map f to an elliptic curve E, with pre-specified branching data. We do this by determining certain relations that the periods of C and E must satisfy and use these…
In this article we introduce algorithms which compute iterations of Gauss-Manin connections, Picard-Fuchs equations of Abelian integrals and mixed Hodge structure of affine varieties of dimension $n$ in terms of differential forms. In the…
In this study, an algorithm for computing the inverse of periodic k banded matrices, which are needed for solving the differential equations by using the finite differences, the solution of partial differential equations and the solution of…
The goal of this paper is to show how to produce a piece of rigorous bifurcation diagram of periodic orbits for an ODE. We study the Rossler system, one of the textbook examples of ODEs generating nontrivial dynamics, for the parameter…
We consider the stability of periodic map with period-$2$ in linear fractional difference equations where the function is $f(x)=ax$ at even times and $f(x)=bx$ at odd times. The stability of such a map for an integer order map depends on…
In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…
We study the problem of estimating the number of points of coincidences of an idealized gap on the set of integers under a given multiplicative function $g:\mathbb{N}\longrightarrow \mathbb{C}$ respectively additive function…
We present an algorithm for the computation of period matrices and the Abel-Jacobi map of complex superelliptic curves given by an equation $y^m=f(x)$. It relies on rigorous numerical integration of differentials between Weierstrass points,…
We \emph{propose} a new \emph{invariant} for a \emph{cycle} of an \emph{interval map} $f:[0,1] \to [0,1]$, called its \emph{unfolding number}.
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…
Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…
We discuss the structure of negacyclic codes of odd length over the ring $\mathbb{F}_p[u, v]/ \langle u^2, v^2, uv-vu \rangle$. We find the unique generating set, the rank and the minimum distance for these negacyclic codes.
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…
We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map $x\mapsto g^x\pmod p$ that acts on the set $\{1, \ldots, p-1\}$.
Let $\core G$ and $\corona G$ denote the intersection and the union, respectively, of all maximum independent sets of a graph $G$. In this work, we show that for a graph with at most two odd cycles, $\a{\core G}+\a{\corona G}$ is equal to…