arXiv subjects

Slawomir Lasota

Publications and source records attributed to Slawomir Lasota.

13 recordsLinked to original sources

arXiv2024

A survey for variable stars with small telescopes: IX -- Evolution of Spot Properties on YSOs in IC5070

We present spot properties on 32 periodic young stellar objects in IC 5070. Long term, $\sim$5 yr, light curves in the $V$, $R$, and $I$-bands are obtained through the HOYS (Hunting Outbursting Young Stars) citizen science project. These are dissected into six months long slices, with 3 months oversampling, to measure 234 sets of amplitudes in all filters. We fit 180 of these with reliable spot solutions. Two thirds of spot solutions are cold spots, the lowest is 2150 K below the stellar temperature. One third are warm spots that are above the stellar temperature by less than $\sim$2000 K. Cold and warm spots have maximum surface coverage values of 40 percent, although only 16 percent of warm spots are above 20 percent surface coverage as opposed to 60 percent of the cold spots. Warm spots are most likely caused by a combination of plages and low density accretion columns, most common on objects without inner disc excess emission in $K-W2$. Five small hot spot solutions have $<3$ percent coverage and are 3000 - 5000 K above the stellar temperature. These are attributed to accretion, and four of them occur on the same object. The majority of our objects are likely to be accreting. However, we observe very few accretion hot spots as either the accretion is not stable on our timescale or the photometry is dominated by other features. We do not identify cyclical spot behaviour on the targets. We additionally identify and discuss a number of objects that have interesting amplitudes, phase changes, or spot properties.

astro-ph.SR↗

arXiv2024

A survey for variable young stars with small telescopes: VIII -- Properties of 1687 Gaia selected members in 21 nearby clusters

The Hunting Outbursting Young Stars (HOYS) project performs long-term, optical, multi-filter, high cadence monitoring of 25 nearby young clusters and star forming regions. Utilising Gaia DR3 data we have identified about 17000 potential young stellar members in 45 coherent astrometric groups in these fields. Twenty one of them are clear young groups or clusters of stars within one kiloparsec and they contain 9143 Gaia selected potential members. The cluster distances, proper motions and membership numbers are determined. We analyse long term (about 7yr) V, R, and I-band light curves from HOYS for 1687 of the potential cluster members. One quarter of the stars are variable in all three optical filters, and two thirds of these have light curves that are symmetric around the mean. Light curves affected by obscuration from circumstellar materials are more common than those affected by accretion bursts, by a factor of 2-4. The variability fraction in the clusters ranges from 10 to almost 100 percent, and correlates positively with the fraction of stars with detectable inner disks, indicating that a lot of variability is driven by the disk. About one in six variables shows detectable periodicity, mostly caused by magnetic spots. Two thirds of the periodic variables with disk excess emission are slow rotators, and amongst the stars without disk excess two thirds are fast rotators - in agreement with rotation being slowed down by the presence of a disk.

astro-ph.SR↗

arXiv2023

A survey for variable young stars with small telescopes: VI -- Analysis of the outbursting Be stars NSW284, Gaia19eyy, and VES263

This paper is one in a series reporting results from small telescope observations of variable young stars. Here, we study the repeating outbursts of three likely Be stars based on long-term optical, near-infrared, and mid-infrared photometry for all three objects, along with follow-up spectra for two of the three. The sources are characterised as rare, truly regularly outbursting Be stars. We interpret the photometric data within a framework for modelling light curve morphology, and find that the models correctly predict the burst shapes, including their larger amplitudes and later peaks towards longer wavelengths. We are thus able to infer the start and end times of mass loading into the circumstellar disks of these stars. The disk sizes are typically 3-6 times the areas of the central star. The disk temperatures are ~40%, and the disk luminosities are ~10% of those of the central Be star, respectively. The available spectroscopy is consistent with inside-out evolution of the disk. Higher excitation lines have larger velocity widths in their double-horned shaped emission profiles. Our observations and analysis support the decretion disk model for outbursting Be stars.

astro-ph.SR↗

arXiv2022

The TESS Grand Unified Hot Jupiter Survey. I. Ten TESS Planets

We report the discovery of ten short-period giant planets (TOI-2193A b, TOI-2207 b, TOI-2236 b, TOI-2421 b, TOI-2567 b, TOI-2570 b, TOI-3331 b, TOI-3540A b, TOI-3693 b, TOI-4137 b). All of the planets were identified as planet candidates based on periodic flux dips observed by NASA's Transiting Exoplanet Survey Satellite (TESS). The signals were confirmed to be from transiting planets using ground-based time-series photometry, high angular resolution imaging, and high-resolution spectroscopy coordinated with the TESS Follow-up Observing Program. The ten newly discovered planets orbit relatively bright F and G stars ($G < 12.5$,~$T_\mathrm{eff}$ between 4800 and 6200 K). The planets' orbital periods range from 2 to 10~days, and their masses range from 0.2 to 2.2 Jupiter masses. TOI-2421 b is notable for being a Saturn-mass planet and TOI-2567 b for being a ``sub-Saturn'', with masses of $0.322\pm 0.073$ and $0.195\pm 0.030$ Jupiter masses, respectively. In most cases, we have little information about the orbital eccentricities. Two exceptions are TOI-2207 b, which has an 8-day period and a detectably eccentric orbit ($e = 0.17\pm0.05$), and TOI-3693 b, a 9-day planet for which we can set an upper limit of $e < 0.052$. The ten planets described here are the first new planets resulting from an effort to use TESS data to unify and expand on the work of previous ground-based transit surveys in order to create a large and statistically useful sample of hot Jupiters.

astro-ph.EP↗

arXiv2019

The Reachability Problem for Petri Nets is Not Elementary

Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack.

cs.FL↗

arXiv2016

Simulation Problems Over One-Counter Nets

One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.

cs.LO↗

arXiv2015

Undecidability of performance equivalence of Petri nets

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary setting (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth variant remains an intriguing open problem.

cs.CC↗

arXiv2013

Simulation Over One-counter Nets is PSPACE-Complete

One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity was an open problem. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.

cs.FL↗

arXiv2009

On subset seeds for protein alignment

We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them to construct several alphabets. We then perform a comparative analysis of seeds built over those alphabets and compare them with the standard BLASTP seeding method [2], [3], as well as with the family of vector seeds proposed in [4]. While the formalism of subset seeds is less expressive (but less costly to implement) than the cumulative principle used in BLASTP and vector seeds, our seeds show a similar or even better performance than BLASTP on Bernoulli models of proteins compatible with the common BLOSUM62 matrix. Finally, we perform a large-scale benchmarking of our seeds against several main databases of protein alignments. Here again, the results show a comparable or better performance of our seeds vs. BLASTP.

q-bio.QM↗

arXiv2008

Efficient seeding techniques for protein similarity search

We apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them to construct several alphabets.We then perform an analysis of seeds built over those alphabet and compare them with the standard Blastp seeding method [2,3], as well as with the family of vector seeds proposed in [4]. While the formalism of subset seed is less expressive (but less costly to implement) than the accumulative principle used in Blastp and vector seeds, our seeds show a similar or even better performance than Blastp on Bernoulli models of proteins compatible with the common BLOSUM62 matrix.

q-bio.QM↗

arXiv2008

Logical Relations for Monadic Types

Logical relations and their generalizations are a fundamental tool in proving properties of lambda-calculi, e.g., yielding sound principles for observational equivalence. We propose a natural notion of logical relations able to deal with the monadic types of Moggi's computational lambda-calculus. The treatment is categorical, and is based on notions of subsconing, mono factorization systems, and monad morphisms. Our approach has a number of interesting applications, including cases for lambda-calculi with non-determinism (where being in logical relation means being bisimilar), dynamic name creation, and probabilistic systems.

cs.LO↗

arXiv2006

On Completeness of Logical Relations for Monadic Types

Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting properties can be expressed formally by contextual equivalence (a.k.a. observational equivalence). Furthermore, imperative features, which exist in most real-life software, can be nicely expressed in the so-called computational lambda-calculus. Contextual equivalence is difficult to prove directly, but we can often use logical relations as a tool to establish it in lambda-calculi. We have already defined logical relations for the computational lambda-calculus in previous work. We devote this paper to the study of their completeness w.r.t. contextual equivalence in the computational lambda-calculus.

cs.LO↗

arXiv2006

Alternating Timed Automata

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages which is closed under boolean operations and which has an effective presentation. We prove that the complexity of the emptiness problem for alternating timed automata with one clock is non-primitive recursive. The proof gives also the same lower bound for the universality problem for nondeterministic timed automata with one clock. We investigate extension of the model with epsilon-transitions and prove that emptiness is undecidable. Over infinite words, we show undecidability of the universality problem.

cs.LO↗