Related papers: Time-Reversibility in 2-Dim Systems

Symmetry group methods are applied to obtain all explicit group-invariant radial solutions to a class of semilinear Schrodinger equations in dimensions $n\neq 1$. Both focusing and defocusing cases of a power nonlinearity are considered,…

The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…

In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…

In the present paper invariant subspace method has been extended for solving systems of multi-term fractional partial differential equations (FPDEs) involving both time and space fractional derivatives. Further the method has also been…

A direct and systematic algorithm is proposed to find one-dimensional optimal system for the group invariant solutions, which is attributed to the classification of its corresponding one-dimensional Lie algebra. Since the method is based on…

It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…

We present a general analysis of the bifurcation sequences of periodic orbits in general position of a family of reversible 1:1 resonant Hamiltonian normal forms invariant under $\Z_2\times\Z_2$ symmetry. The rich structure of these…

We provide an effective algorithm for determining whether an element of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list which can be checked for periodic proper free factors.

In this paper, we develop an ensemble-based time-stepping algorithm to efficiently find numerical solutions to a group of linear, second-order parabolic partial differential equations (PDEs). Particularly, the PDE models in the group could…

It is known that orthogonal polynomials obey a 3 terms recursion relation, as well as a 2x2 differential system. Here, we give an explicit and concise expression of the differential system in terms of the recursion coefficients. This result…

We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for…

We propose algorithms for efficient time integration of large systems of oscillatory second order ordinary differential equations (ODEs) whose solution can be expressed in terms of trigonometric matrix functions. Our algorithms are based on…

Two classes of time-periodic systems of ordinary differential equations with a small nonnegative parameter, those with fast and slow time, are studied. Right-hand sides of these systems are three times continuously differentiable with…

We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…

Let ${\mathcal C}$ be a proper minor-closed family of graphs. We present a randomized algorithm that given a graph $G \in {\mathcal C}$ with $n$ vertices, finds a simple cycle of size $k$ in $G$ (if exists) in $2^{O(k)}n$ time. The…

The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…

In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

In this work we classify all the order-two Hypergeometric operators $D$, symmetric with respect to some $2\times 2$ irreducible matrix-weight $W$ such that $DP_n=P_n\left(\begin{smallmatrix} \lambda_n&0\\0&\mu_n \end{smallmatrix} \right)$…

Coefficient inverse problems related to identifying the right-hand side of an equation with use of additional information is of interest among inverse problems for partial differential equations. When considering non-stationary problems,…