In an earlier work [S. Kastha et al., PRD {\bf 98}, 124033 (2018)], we developed the {\it parametrized multipolar gravitational wave phasing formula}…

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal polynomials. In…

We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(…

We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accur…

The formal verification of large probabilistic models is important and challenging. Exploiting the concurrency that is often present is one way to ad…

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of s…

Mapper is an algorithm that summarizes the topological information contained in a dataset and provides an insightful visualization. It takes as input…

To show that the decision version of perfect matching is hard for L, we show that the problem of path ordering, can be reduced to the perfect matching problem for k-trees. We give the proof in the full version: {lemma} Determining whether a k-tree h…

Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [JT07]. However, for…

A general method for deriving exact expressions for vector potentials produced by arbitrarily knotted solenoids is presented. It consists of using si…

We propose a novel method to test the consistency of the multipole moments of compact binary systems with the predictions of General Relativity (GR).…

For binary neutron star (BNS) mergers detectable from the nearby Universe, the distribution of orbital inclination angles ($\iota$), as measured from…

We consider problems lying at the intersection of 2 relevant questions in online learning—how does one adapt to slowly varying data, and what best can be done with a constraint on information. As far as we know, the proposed algorithms are the first…

We study how to adapt to smoothly-varying ('easy') environments in well-known online learning problems where acquiring information is expensive. For …

We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There …

We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect match…

When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one op…

Ideal systems like MHD and Euler flow may develop singularities in vorticity (w = curl v). Viscosity and resistivity provide dissipative regularizati…

We analyze the dynamics of entanglement in a two-qubit system interacting with an initially squeezed thermal environment via a quantum nondemolition …

We propose a framework of genetic algorithms which use multi-level hierarchies to solve an optimization problem by searching over the space of simple…

Let g=sl3 (that is, r=2). Let λ=4ϵ1+2ϵ2 and λ––=4≥2≥0. In P(λ––) there are three patterns of weight 0 and here they are listed in row-dominance order:

We consider two bases for an arbitrary finite dimensional irreducible representation of a complex special linear Lie algebra: the classical Gelfand-T…

Continuing the recent trend, in this article we design several space-efficient algorithms for two well-known graph search methods. Both these search …

Metropolis algorithm has been extensively employed for simulating a canonical ensemble and estimating macroscopic properties of a closed system at any desired temperature. A mechanical property, like energy can be calculated by averaging over a larg…

Metropolis algorithm has been extensively employed for simulating a canonical ensemble and estimating macroscopic properties of a closed system at an…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account