Searcharxiv⌕ Search

arXiv subjects

Manish Kumar

Publications and source records attributed to Manish Kumar.

At least 109 records · Page 6Linked to original sources

Investigating the orbital evolution of the eccentric HMXB GX 301$-$2 using long-term X-ray lightcurves

We report the orbital decay rate of the high mass X-ray binary GX 301$-$2 from an analysis of its long-term X-ray light curves and pulsed flux histories from CGRO/BATSE, RXTE/ASM, Swift/BAT, Fermi/GBM and MAXI by timing the pre-periastron flares over a span of almost 30 years. The time of arrival of the pre-periastron flares exhibits an energy dependence (hard lag) and the orbital period decay was estimated after correcting for it. This method of orbital decay estimation is unaffected by the fluctuations in the spin rate of the X-ray pulsar associated with variations in the mass accretion rate. The resulting $\dot P_\textrm{orb}$ $=-(1.98\pm0.28)\times10^{-6}$ s s$^{-1}$ indicates a rapid evolution timescale of $|P_\textrm{orb}/\dot P_\textrm{orb}|\sim 0.6\times10^{5}$ yr, making it the high mass X-ray binary with the fastest orbital decay. Our estimate of $\dot P_\mathrm{orb}$ is off by a factor of $\sim2$ from the previously reported value of $-(3.7\pm0.5)\times10^{-6}$ s s$^{-1}$ estimated from pulsar TOA analysis. We discuss various possible mechanisms that could drive this rapid orbital decay and also suggest that GX 301$-$2 is a prospective Thorne-Żytkow candidate.

astro-ph.HE↗

Identifying the origin of delayed electroluminescence in a polariton organic light-emitting diode

Modifying the energy landscape of existing molecular emitters is an attractive challenge with favourable outcomes in chemistry and organic optoelectronic research. It has recently been explored through strong light-matter coupling studies where the organic emitters were placed in an optical cavity. Nonetheless, a debate revolves around whether the observed change in the material properties represents novel coupled system dynamics or the unmasking of pre-existing material properties induced by light-matter interactions. Here, for the first time, we examined the effect of strong coupling in polariton organic light-emitting diodes via time-resolved electroluminescence studies. We accompanied our experimental analysis with theoretical fits using a model of coupled rate equations accounting for all major mechanisms that can result in delayed electroluminescence in organic emitters. We found that in our devices the delayed electroluminescence was dominated by emission from trapped charges and this mechanism remained unmodified in the presence of strong coupling.

cond-mat.mtrl-sci↗

Multi-orbital Kondo screening in strongly correlated polyradical nanographenes

We discuss coexistence of Kondo and spin excitation signals in tunneling spectroscopy in strongly correlated polyradical $π$-magnetic nanographenes on a metal surface. The Kondo signal is rationalized by a multi-orbital Kondo screening of the unpaired electrons. The fundamental processes are spin-flips of antiferromagnetic (AFM) order involving charged molecular multiplets. We introduce a~perturbative model, which provides simple rules to identify the presence of AFM channels responsible for Kondo screening. The Kondo regime is confirmed by numerical renormalization group calculations. This framework can be applied to similar strongly correlated open-shell systems.

cond-mat.str-el↗

Conjugate variables approach to mixed $q$-Araki-Woods algebras: Factoriality and non-injectivity

We establish factoriality and non-injectivity in full generality for the mixed $q$-Araki-Woods von Neumann algebra associated to a separable real Hilbert space $\mathsf{H}_{\mathbf{R}}$ with $\dim\mathsf{H}_{\mathbf{R}}\geq 2$, a strongly continuous one parameter group of orthogonal transformations on $\mathsf{H}_\mathbb{R}$, a direct sum decomposition $\mathsf{H}_{\mathbf{R}}=\oplus_{i}\mathsf{H}_{\mathbb{R}}^{(i)}$, and a real symmetric matrix $(q_{ij})$ with $q=\sup_{i,j}|q_{ij}|<1$. This is achieved by first proving the existence of conjugate variables for a finite number of generators of the algebras, following the lines of Miyagawa-Speicher and Kumar-Skalski-Wasilewski. The conjugate variables belong to the factors in question and satisfy certain Lipschitz condition.

math.OA↗

Security of XCB and HCTR

Tweakable Enciphering Scheme (TES) is a length preserving scheme which provides confidentiality and admissible integrity. XCB (Extended Code Book) is a TES which was introduced in 2004. In 2007, it was modified and security bound was provided. Later, these two versions were referred to as XCBv1 and XCBv2 respectively. XCBv2 was proposed as the IEEE-std 1619.2 2010 for encryption of sector oriented storage media. In 2013, first time Security bound of XCBv1 was given and XCBv2's security bound was enhanced. A constant of $2^{22}$ appears in the security bounds of the XCBv1 and XCBv2. We showed that this constant of $2^{22}$ can be reduced to $2^{5}$. Further, we modified the XCB (MXCB) scheme such that it gives better security bound compared to the present XCB scheme. We also analyzed some weak keys attack on XCB and a type of TES known as HCTR (proposed in 2005). We performed distinguishing attack and the hash key recovery attack on HCTR. Next, we analyzed the dependency of the two different keys in HCTR.

cs.CR↗

Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

This paper studies the message complexity of authenticated Byzantine agreement (BA) in synchronous, fully-connected distributed networks under an honest majority. We focus on the so-called {\em implicit} Byzantine agreement problem where each node starts with an input value and at the end a non-empty subset of the honest nodes should agree on a common input value by satisfying the BA properties (i.e., there can be undecided nodes). We show that a sublinear (in $n$, number of nodes) message complexity BA protocol under honest majority is possible in the standard PKI model when the nodes have access to an unbiased global coin and hash function. In particular, we present a randomized Byzantine agreement algorithm which, with high probability achieves implicit agreement, uses $\tilde{O}(\sqrt{n})$ messages, and runs in $\tilde{O}(1)$ rounds while tolerating $(1/2 - ε)n$ Byzantine nodes for any fixed $ε> 0$, the notation $\Tilde{O}$ hides a $O(\polylog{n})$ factor. The algorithm requires standard cryptographic setup PKI and hash function with a static Byzantine adversary. The algorithm works in the CONGEST model and each node does not need to know the identity of its neighbors, i.e., works in the $KT_0$ model. The message complexity (and also the time complexity) of our algorithm is optimal up to a $\polylog n$ factor, as we show a $Ω(\sqrt{n})$ lower bound on the message complexity.

cs.DC↗

Quot schemes and Fourier-Mukai transformation

We consider several related examples of Fourier-Mukai transformations involving the quot scheme. A method of showing conservativity of these Fourier-Mukai transformations is described.

math.AG↗

Effect of polymer additives on dynamics of water level in an open channel

The presence of a tiny amount of polymers (a few parts per million) in a fluid dramatically reduces turbulent drag. For this reason, polymer additives have been proposed to be used in flood remediation: in an open channel at a fixed flow rate, the decrease in friction due to polymer addition is expected to lead to a decrease in water height in the channel. However, in a recent field experiment, a counterintuitive transient increase in water height has been observed far downstream of polymer injection. We numerically investigate the effect of polymer additives on the water height in a long canal using the shallow water equations augmented with an evolution equation for polymer concentration that incorporates turbulent dispersion and polymer degradation. Just downstream of polymer injection, the water height decreases due to the decreased friction at a fixed volumetric flow rate. Further downstream, however, the height can increase, consistent with the experimental observation. We elucidate the mechanism of this unexpected rise in water height in the canal. We also suggest a technique to mitigate the water rise, as this is detrimental for practical applications.

physics.flu-dyn↗

A framework of windowed octonion linear canonical transform

The uncertainty principle is a fundamental principle in theoretical physics, such as quantum mechanics and classical mechanics. It plays a prime role in signal processing, including optics, where a signal is to be analyzed simultaneously in both domains; for instance, in harmonic analysis, both time and frequency domains, and in quantum mechanics, both time and momentum. On the other hand, many mathematicians, physicists, and other related domain researchers have paid more attention to the octonion-related integral transforms in recent years. In this paper, we define important properties of the windowed octonion linear canonical transform (WOCLCT), such as inversion, linearity, parity, shifting, and the relationship between OCLCT and WOCLCT. Further, we derived sharp Pitt's and sharp Young-Hausdorff inequalities for 3D WOCLCT. We obtain the logarithmic uncertainty principle for the 3D WOCLCT. Furthermore, Heisenberg's and Donoho-Stark's uncertainty principles are derived for WOCLCT, and the potential applications of WOCLCT are also discussed.

eess.SP↗

Generalized Linear Models of T$_{90}$-T$_{50}$ relation to classify GRBs

Gamma-ray bursts (GRBs) can be classified with their linearly dependent parameters alongside the standard $T_{90}$ distribution. The Generalized linear mixture model(GLM) identifies the number of linear dependencies in a two-parameter space. Classically, GRBs are classified into two classes by the presence of bimodality in the histogram of T$_{90}$. However, additional classes and sub-classes of GRBs are fascinating topics to explore. In this work, we investigate the GRBs classes in the $ T_{90} {-}T_{50}$ plane using the Generalized Linear Models(GLM) for Fermi GBM and BATSE catalogs. This study shows five linear features for the Fermi GBM catalog and four linear features for the BATSE catalog, directing towards the possibility of more than two GRB classes.

astro-ph.HE↗

Full solution of the factoriality question for $q$-Araki-Woods von Neumann algebras via conjugate variables

We establish factoriality of $q$-Araki-Woods von Neumann algebras (with the number of generators at least two) in full generality, exploiting the approach via conjugate variables developed recently in the tracial case by Akihiro Miyagawa and Roland Speicher, and abstract results of Brent Nelson. We also establish non-injectivity and determine the type of the factors in question. The factors are solid and full when the number of generators is finite.

math.OA↗

Highly-Entangled Polyradical Nanographene with Coexisting Strong Correlation and Topological Frustration

Open-shell benzenoid polycyclic aromatic hydrocarbons, known as magnetic nanographenes, exhibit unconventional p-magnetism arising from topological frustration or strong electronic-electron (e-e) interaction. Imprinting multiple strongly entangled spins into polyradical nanographenes creates a major paradigm shift in realizing non-trivial collective quantum behaviors and exotic quantum phases in organic quantum materials. However, conventional design approaches are limited by a single magnetic origin, which can restrict the number of correlated spins or the type of magnetic ordering in open-shell nanographenes. Here, we present a novel design strategy combing topological frustration and e-e interactions to fabricate the largest fully-fused open-shell nanographene reported to date, a 'butterfly'-shaped tetraradical on Au(111). We employed bond-resolved scanning tunneling microscopy and spin excitation spectroscopy to unambiguously resolve the molecular backbone and reveal the strongly correlated open-shell character, respectively. This nanographene contains four unpaired electrons with both ferromagnetic and anti-ferromagnetic interactions, harboring a many-body singlet ground state and strong multi-spin entanglement, which can be well described by many-body calculations. Furthermore, we demonstrate that the nickelocene magnetic probe can sense highly-correlated spin states in nanographene. The ability to imprint and characterize many-body strongly correlated spins in polyradical nanographenes not only presents exciting opportunities for realizing non-trivial quantum magnetism and phases in organic materials but also paves the way toward high-density ultrafast spintronic devices and quantum information technologies.

cond-mat.mtrl-sci↗

DeepCPG Policies for Robot Locomotion

Central Pattern Generators (CPGs) form the neural basis of the observed rhythmic behaviors for locomotion in legged animals. The CPG dynamics organized into networks allow the emergence of complex locomotor behaviors. In this work, we take this inspiration for developing walking behaviors in multi-legged robots. We present novel DeepCPG policies that embed CPGs as a layer in a larger neural network and facilitate end-to-end learning of locomotion behaviors in deep reinforcement learning (DRL) setup. We demonstrate the effectiveness of this approach on physics engine-based insectoid robots. We show that, compared to traditional approaches, DeepCPG policies allow sample-efficient end-to-end learning of effective locomotion strategies even in the case of high-dimensional sensor spaces (vision). We scale the DeepCPG policies using a modular robot configuration and multi-agent DRL. Our results suggest that gradual complexification with embedded priors of these policies in a modular fashion could achieve non-trivial sensor and motor integration on a robot platform. These results also indicate the efficacy of bootstrapping more complex intelligent systems from simpler ones based on biological principles. Finally, we present the experimental results for a proof-of-concept insectoid robot system for which DeepCPG learned policies initially using the simulation engine and these were afterwards transferred to real-world robots without any additional fine-tuning.

cs.RO↗

Improved Deterministic Leader Election in Diameter-Two Networks

In this paper, we investigate the leader election problem in diameter-two networks. Recently, Chatterjee et al. [DC 2020] studied the leader election in diameter-two networks. They presented a $O(\log n)$-round deterministic {implicit} leader election algorithm which incurs optimal $O(n\log n)$ messages, but a drawback of their algorithm is that it requires knowledge of $n$. An important question -- whether it is possible to remove the assumption on the knowledge of $n$ was left open in their paper. Another interesting open question raised in their paper is whether {\em explicit} leader election can be solved in $\tilde{O}(n)$ messages deterministically. In this paper, we give an affirmative answer to them. Further, we solve the {\em broadcast problem}, another fundamental problem in distributed computing, deterministically in diameter-two networks with $\tilde{O}(n)$ messages and $\tilde{O}(1)$ rounds without the knowledge of $n$. In fact, we address all the open questions raised by Chatterjee et al. for the deterministic leader election problem in diameter-two networks. To the best of our knowledge, this is the first $\tilde{O}(n)$ deterministic result for the explicit leader election in the diameter-two networks, that too without the knowledge of $n$.

cs.DC↗

Stress and stretching regulate dispersion in viscoelastic porous media flows

In this work, we study the role of viscoelastic instability in the mechanical dispersion of fluid flow through porous media at high Peclet numbers. Using microfluidic experiments and numerical simulations, we show that viscoelastic instability in flow through a hexagonally ordered (staggered) medium strongly enhances dispersion transverse to the mean flow direction with increasing Weissenberg number (Wi). In contrast, preferential flow paths can quench the elastic instability in disordered media, which has two important consequences for transport: First, the lack of chaotic velocity fluctuations reduces transverse dispersion relative to unstable flows. Second, the amplification of flow along preferential paths with increasing Wi causes strongly-correlated stream-wise flow that enhances longitudinal dispersion. Finally, we illustrate how the observed dispersion phenomena can be understood through the lens of Lagrangian stretching manifolds, which act as advective transport barriers and coincide with high stress regions in these viscoelastic porous media flows.

physics.flu-dyn↗

Fault-Tolerant Dispersion of Mobile Robots

We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of $k\leq n$ robots in an $n$-node anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to $f \leq k$ robots may fail by crashing arbitrarily and subsequently lose all the information stored at the robots, rendering them unable to communicate. In this paper, we solve the dispersion problem in a crash-fault setting by considering two different initial configurations: i) the rooted configuration, and ii) the arbitrary configuration. In the rooted case, all robots are placed together at a single node at the start. The arbitrary configuration is a general configuration (a.k.a. arbitrary configuration in the literature) where the robots are placed in some $l<k$ clusters arbitrarily across the graph. For the first case, we develop an algorithm solving dispersion in the presence of faulty robots in $O(k^2)$ rounds, which improves over the previous $O(f\cdot\text{min}(m,kΔ))$-round result by \cite{PS021}. For the arbitrary configuration, we present an algorithm solving dispersion in $O((f+l)\cdot\text{min}(m, k Δ, k^2))$ rounds, when the number of edges $m$ and the maximum degree $Δ$ of the graph is known to the robots.

cs.DC↗

Development of Linear Battery Model for Path Planning with Mixed Integer Linear Programming: Simulated and Experimental Validation

Mixed Integer Linear Programs (MILPs) are often used in the path planning of both ground and aerial vehicles. Such a formulation of the path planning problem requires a linear objective function and constraints, limiting the fidelity of the the tracking of vehicle states. One such parameter is the state of charge of the battery used to power the vehicle. Accurate battery state estimation requires nonlinear differential equations to be solved. This state estimation is important in path planning to ensure flyable paths, however when using MILPs to formulate the path planning problem these nonlinear equations cannot be implemented. Poor accuracy in battery estimation during the path planning runs the risk of the planned path being feasible by the estimation model but in reality will deplete the battery to a critical level. To the end of higher accuracy battery estimation within a MILP, we present here a simple linear battery model which predicts the change in state-of-charge (SOC) of a battery given a power draw and duration. This model accounts for changes in battery voltage due to applied electrical load and changes in battery SOC. The battery model is presented and then tested against alternate battery models in numerical and in experimental tests. Further, the effect the proposed linear model has over a simpler SOC estimation on the time-to-solve a resource constrained shortest path problem is also evaluated, implemented in two different algorithms. It is seen that the linear model performs well in battery state estimation while remaining implementable in a Linear Program or MILP, with little affect on the time-to-solve.

math.OC↗

Partially Disjoint k Shortest Paths

A solution of the $k$ shortest paths problem may output paths that are identical up to a single edge. On the other hand, a solution of the $k$ independent shortest paths problem consists of paths that share neither an edge nor an intermediate node. We investigate the case in which the number of edges that are not shared among any two paths in the output $k$-set is a parameter. We study two main directions: exploring \emph{near-shortest} paths and exploring \emph{exactly shortest paths}. We assume that the weighted graph $G=(V,E,w)$ has no parallel edges and that the edge lengths (weights) are positive. Our results are also generalized to the cases of $k$ shortest paths where there are several weights per edge, and the results should take into account the multi-criteria prioritized weight.

cs.DS↗