SearcharxivSearch

arXiv subjects

Indrajit Paul

Publications and source records attributed to Indrajit Paul.

10 recordsLinked to original sources

WALOP-South: a four camera one shot imaging polarimeter for the PASIPHAE survey. Paper III -- PSF modelling

The two WALOP instruments, built for the PASIPHAE survey, will measure the linear polarization of large numbers of stars in the Galactic polar regions in the SDSS-$r$ band. They are designed with a wide field-of-view, enabling measurement of the Stokes parameters $I$, $q$, and $u$ for multiple stars simultaneously within a $35^\prime \times 35^\prime$ region of sky for WALOP-South and $30^\prime \times 30^\prime$ region for WALOP-North. In this paper, we present a polar shapelet-based PSF photometry framework for well-sampled stellar point sources applicable to WALOP-type wide-field polarimeters. Polar shapelets are a set of orthogonal basis functions, constructed from Gauss-Hermite or Gauss-Laguerre polynomials, that are well-suited to modelling localized PSF in a compact and efficient way. We developed an efficient PSF modelling method that uses polar shapelets as basis functions to reconstruct the spatial variation of the PSF shape across the CCD using Zemax-simulated images of one of the WALOP instruments, and show that a limited number of shapelet coefficients are sufficient to capture this variation consistently across different CCD locations. To simulate realistic star images, we introduce random sub-pixel shifts in the star centroids in the Zemax-simulated images, and account for this using a two-step iterative method that alternately estimates the PSF model and the sub-pixel centroid shift. Applying PSF photometry to the target faint stars, we demonstrate that the photometric accuracy of approximately 0.15% is achievable, and that the reconstructed PSF model can be incorporated into the photometry across different seeing conditions, meeting the polarimetric science requirements of the PASIPHAE survey.

astro-ph.IM

Vertex ordering characterizations of interval r-graphs

An r-partite graph is an interval r-graph if corresponding to each vertex we can assign an interval of the real line such that two vertices u and v of different partite sets are adjacent if and only if their corresponding intervals intersect. In this paper, we provide two vertex-ordering characterizations of interval r-graphs and identify forbidden patterns for interval r-graphs in terms of specific orderings of their vertices.

cs.DM

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns

We introduce the class of circular-arc H-graphs, which generalizes circular-arc graphs, particularly circular-arc bigraphs. We investigate two types of ordering-based characterizations of circular-arc r-graphs. Finally, we provide forbidden patterns for circular-arc r-graphs in terms of specific vertex orderings.

cs.DM

The fine structure of the mean magnetic field in M31

To explore the spatial variations of the regular (mean) magnetic field of the Andromeda galaxy (M31), we use Fourier analysis in azimuthal angle along four rings in the galaxy's plane. The Fourier coefficients give a quantitative measure of strength of the modes, enabling us to compare expectations from mean-field dynamo models of spiral galaxies. Earlier analyses indicated that the axisymmetric magnetic field (azimuthal Fourier mode $m=0$) is sufficient to fit the observed polarization angles in a wide range of galactocentric distances ($r$). We apply a Bayesian inference approach to new, more sensitive radio continuum data at $\lambda \lambda3.59$, $6.18$, and $11.33$ cm and the earlier data at $\lambda 20.46$ cm to reveal sub-dominant contributions from the modes $m=1$, 2, and 3 along with a dominant axisymmetric mode. Magnetic lines of the axisymmetric mode are close to trailing logarithmic spirals which are significantly more open than the spiral arms detectable in the interstellar dust and neutral hydrogen. The form of the $m=0$ mode is consistent with galactic dynamo theory. Both the amplitudes and the pitch angles of the higher azimuthal modes ($m>1$) vary irregularly with $r$ reflecting local variations in the magnetic field structure. The maximum strength of the mean magnetic field of $1.8-2.7 \mu$G (for the axisymmetric part of the field) occurs at $10-14$ kpc but we find that its strength varies strongly along the azimuth; this variation gives rise to the $m=1$ mode. We suggest a procedure of Bayesian inference which is independent of the specific nature of the depolarization and applies when the magneto-ionic layer observable in polarized emission is not symmetric along the line of sight because emission from its far side is completely depolarized.

astro-ph.GA

New Vertex Ordering Characterizations of Circular-Arc Bigraphs

In this article, we present two new characterizations of circular-arc bigraphs based on their vertex ordering. Also, we provide a characterization of circular-arc bigraphs in terms of forbidden patterns with respect to a particular ordering of their vertices.

math.CO

Bipartite Powers of Certain Classes of Bipartite Graphs

The concept of graph powers has been extensively studied in graph theory. Analogous to graph powers, Chandran et al. [3] introduced the notion of bipartite powers for bipartite graphs. In this paper, we show that the class of interval bigraphs, as well as the class of proper interval bigraphs are closed under the operation of taking bipartite powers. Finally, we define strongly closed property for bipartite graphs under powers and have shown that the class of chordal bipartite graphs is strongly closed under bipartite powers.

math.CO

Obstruction characterization of co-TT graphs

Threshold tolerance graphs and their complement graphs, known as co-TT graphs, were introduced by Monma, Reed, and Trotter[24]. Building on this, Hell et al.[19] introduced the concept of negative interval. Then they proceeded to define signedinterval digraphs/ bigraphs, demonstrating their equivalence to several seemingly distinct classes of digraphs/ bigraphs. They also showed that co-TT graphs are equivalent to symmetric signed-interval digraphs, where some vertices of the digraphs have loops and others do not. We have showed that this actually solve the representation characterization problem of co-TT graphs posed by Monma, Reed and Trotter [24]. In this paper, we characterize signed-interval bigraphs and signed-interval graphs in terms of their biadjacency matrices and adjacency matrices, respectively. Moreover we emphasize on the geometric representation of signed-interval graphs, i.e. co-TT graphs. Finally, by utilizing the geometric representation of signed-interval graphs, we resolve the open problem of characterizing co-TT graphs in terms of minimal forbidden induced subgraphs, a problem initially posed by Monma, Reed, and Trotter in the same paper.

cs.DM

On Hamiltonian-Connected and Mycielski graphs

A graph $G$ is Hamiltonian-connected if there exists a Hamiltonian path between any two vertices of $G$. It is known that if $G$ is 2-connected then the graph $G^2$ is Hamiltonian-connected. In this paper we prove that the square of every self-complementary graph of order grater than 4 is Hamiltonian-connected. If $G$ is a $k$-critical graph, then we prove that the Mycielski graph $μ(G)$ is $(k+1)$-critical graph. Jarnicki et al.[7] proved that for every Hamiltonian graph of odd order, the Mycielski graph $μ(G)$ of $G$ is Hamiltonian-connected. They also pose a conjecture that if $G$ is Hamiltonian-connected and not $K_2$ then $μ(G)$ is Hamiltonian-connected. In this paper we also prove this conjecture.

cs.DM

On powers of circular arc graphs

A class of graphs $\mathcal{C}$ is closed under powers if for every graph $G\in\mathcal{C}$ and every $k\in\mathbb{N}$, $G^k\in\mathcal{C}$. Also $\mathcal{C}$ is strongly closed under powers if for every $k\in\mathbb{N}$, if $G^k\in\mathcal{C}$, then $G^{k+1}\in\mathcal{C}$. It is known that circular arc graphs and proper circular arc graphs are closed under powers. But it is open whether these classes of graphs are also strongly closed under powers. In this paper we have settled these problems.

cs.DM

Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs

In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and interval bigraphs. In this context we have observed that signed interval graphs coincide with the complement of Threshold tolerance graphs(co-TT graphs) introduced by Monma, Reed and Trotter \cite{22}. Finally, we have solved the open problem of forbidden induced subgraph characterization of co-TT graphs posed by them in the same paper.

cs.DM