scholarly journals Critical Relations of Crowns in Critical Times of Coronavirus Depression

Order ◽  
2021 ◽  
Author(s):  
Ádám Kunos ◽  
Miklós Maróti ◽  
László Zádori
Keyword(s):  
Direct Product ◽  
Polynomial Time ◽  
Building Blocks ◽  
Relational Structure ◽  
Membership Problem ◽  
Relational Clone ◽  
Critical Times

AbstractThe critical relations are the building blocks of the relational clone of a relational structure with respect to the relational operations intersection and direct product. In this paper we describe the critical relations of crowns. As a consequence, we obtain that the subpower membership problem for any crown is polynomial-time solvable.

scholarly journals Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups

2007 ◽  
Vol 7 (5&6) ◽  
pp. 559-570
Author(s):  
Y. Inui ◽  
F. Le Gall
Keyword(s):  
Direct Product ◽  
Polynomial Time ◽  
Efficient Algorithm ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Black Box ◽  
Hidden Subgroup Problem ◽  
Time Quantum ◽  
Subgroup Problem

In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_q$, for $p$ and $q$ prime. We first present a classification of these groups in five classes. Then, we describe a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes: the groups of the form $\mathbb{Z}_{p^r}\rtimes\mathbb{Z}_p$, where $p$ is an odd prime. Our algorithm works even in the most general case where the group is presented as a black-box group with not necessarily unique encoding. Finally, we extend this result and present an efficient algorithm solving the HSP over the groups $\mathbb{Z}^m_{p^r}\rtimes\mathbb{Z}_p$.

Decidability Questions for Insertion Systems and Related Models

2021 ◽  
Vol 180 (1-2) ◽  
pp. 53-76
Author(s):  
Andreas Malcher
Keyword(s):  
Polynomial Time ◽  
Regular Language ◽  
Regular Languages ◽  
The Other ◽  
Maximal Length ◽  
Membership Problem ◽  
Context Sensitive ◽  
Other Hand ◽  
Language Classes ◽  
The One

Insertion systems or insertion grammars are a generative formalism in which words can only be generated by starting with some axioms and by iteratively inserting strings subject to certain contexts of a fixed maximal length. It is known that languages generated by such systems are always context sensitive and that the corresponding language classes are incomparable with the regular languages. On the other hand, it is possible to generate non-semilinear languages with systems having contexts of length two. Here, we study decidability questions for insertion systems. On the one hand, it can be seen that emptiness and universality are decidable. Moreover, the fixed membership problem is solvable in deterministic polynomial time. On the other hand, the usually studied decidability questions such as, for example, finiteness, inclusion, equivalence, regularity, inclusion in a regular language, and inclusion of a regular language turn out to be undecidable. Interestingly, the latter undecidability results can be carried over to other models which are basically able to handle the mechanism of inserting strings depending on contexts. In particular, new undecidability results are obtained for pure grammars, restarting automata, clearing restarting automata, and forgetting automata.

CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA

2001 ◽  
Vol 11 (04) ◽  
pp. 405-445 ◽  
Author(s):  
S. MARGOLIS ◽  
M. SAPIR ◽  
P. WEIL
Keyword(s):  
Free Group ◽  
Polynomial Time ◽  
Finite Groups ◽  
Extension Problem ◽  
Membership Problem ◽  
Finitely Generated ◽  
Inverse Monoids ◽  
Finite Monoid ◽  
Finite Set ◽  
One To One

We relate the problem of computing the closure of a finitely generated subgroup of the free group in the pro-V topology, where V is a pseudovariety of finite groups, with an extension problem for inverse automata which can be stated as follows: given partial one-to-one maps on a finite set, can they be extended into permutations generating a group in V? The two problems are equivalent when V is extension-closed. Turning to practical computations, we modify Ribes and Zalesskiĭ's algorithm to compute the pro-p closure of a finitely generated subgroup of the free group in polynomial time, and to effectively compute its pro-nilpotent closure. Finally, we apply our results to a problem in finite monoid theory, the membership problem in pseudovarieties of inverse monoids which are Mal'cev products of semilattices and a pseudovariety of groups. Résumé: Nous établissons un lien entre le problème du calcul de l'adhéerence d'un sous-groupe finiment engendré du groupe libre dans la topologie pro-V, oú V est une pseudovariété de groupes finis, et un probléme d'extension pour les automates inversifs qui peut être énoncé de la faç con suivante: étant données des transformations partielles injectives d'un ensemble fini, peuvent-elles être étendues en des permutations qui engendrent un groupe dans V? Les deux problèmes sont équivalents si V est fermée par extensions. Nous intéressant ensuite aux calculs pratiques, nous modifions l'algorithme de Ribes et Zalesskiĭ pour calculer l'adhérence pro-p d'un sous-groupe finiment engendré du groupe libre en temps polynomial et pour calculer effectivement sa clôture pro-nilpotente. Enfin nous appliquons nos résultats à un problème de théorie des monoïdes finis, celui de de l'appartenance dans les pseudovariétés de monoïdes inversifs qui sont des produits de Mal'cev de demi-treillis et d'une pseudovariété de groupes.

scholarly journals Finding the prime factors of strong direct product graphs in polynomial time

1992 ◽  
Vol 109 (1-3) ◽  
pp. 77-102 ◽  
Author(s):  
Joan Feigenbaum ◽  
Alejandro A. Schäffer
Keyword(s):  
Direct Product ◽  
Polynomial Time ◽  
Product Graphs ◽  
Prime Factors

scholarly journals Armstrong relations and strong dependencies

2016 ◽  
Vol 13 (3) ◽  
pp. 89-93
Author(s):  
Vũ Đức Thi
Keyword(s):  
Polynomial Time ◽  
Sufficient Condition ◽  
Membership Problem ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

In this paper, the concept of strong scheme is introduced. We prove that the membership problem for strong dependencies is solved by an algorithm in polynomial time. We give a necessary and sufficient condition for a relation to be Armstrong relation of a given strong scheme.

Photochemical Evolution of Interstellar/Precometary Organic Material

1997 ◽  
Vol 161 ◽  
pp. 23-47 ◽  
Author(s):  
Louis J. Allamandola ◽  
Max P. Bernstein ◽  
Scott A. Sandford
Keyword(s):  
Origin Of Life ◽  
Building Blocks ◽  
Complex Species ◽  
Infrared Observations ◽  
Interstellar Ice ◽  
Polycyclic Aromatic ◽  
Ultraviolet Photolysis ◽  
The Origin Of Life ◽  
Simple Molecules ◽  
Complex Organic

AbstractInfrared observations, combined with realistic laboratory simulations, have revolutionized our understanding of interstellar ice and dust, the building blocks of comets. Since comets are thought to be a major source of the volatiles on the primative earth, their organic inventory is of central importance to questions concerning the origin of life. Ices in molecular clouds contain the very simple molecules H2O, CH3OH, CO, CO2, CH4, H2, and probably some NH3and H2CO, as well as more complex species including nitriles, ketones, and esters. The evidence for these, as well as carbonrich materials such as polycyclic aromatic hydrocarbons (PAHs), microdiamonds, and amorphous carbon is briefly reviewed. This is followed by a detailed summary of interstellar/precometary ice photochemical evolution based on laboratory studies of realistic polar ice analogs. Ultraviolet photolysis of these ices produces H2, H2CO, CO2, CO, CH4, HCO, and the moderately complex organic molecules: CH3CH2OH (ethanol), HC(= O)NH2(formamide), CH3C(= O)NH2(acetamide), R-CN (nitriles), and hexamethylenetetramine (HMT, C6H12N4), as well as more complex species including polyoxymethylene and related species (POMs), amides, and ketones. The ready formation of these organic species from simple starting mixtures, the ice chemistry that ensues when these ices are mildly warmed, plus the observation that the more complex refractory photoproducts show lipid-like behavior and readily self organize into droplets upon exposure to liquid water suggest that comets may have played an important role in the origin of life.

Laboratory and in-situ analysis of comet dust

1988 ◽  
Vol 46 ◽  
pp. 8-9
Author(s):  
D.E. Brownlee ◽  
A.L. Albee
Keyword(s):  
Electron Microscopy ◽  
Solar System ◽  
Laboratory Study ◽  
Isotopic Analysis ◽  
Building Blocks ◽  
Sem Analysis ◽  
Early Solar System ◽  
Cometary Material ◽  
Comet Dust

Comets are primitive, kilometer-sized bodies that formed in the outer regions of the solar system. Composed of ice and dust, comets are generally believed to be relic building blocks of the outer solar system that have been preserved at cryogenic temperatures since the formation of the Sun and planets. The analysis of cometary material is particularly important because the properties of cometary material provide direct information on the processes and environments that formed and influenced solid matter both in the early solar system and in the interstellar environments that preceded it.The first direct analyses of proven comet dust were made during the Soviet and European spacecraft encounters with Comet Halley in 1986. These missions carried time-of-flight mass spectrometers that measured mass spectra of individual micron and smaller particles. The Halley measurements were semi-quantitative but they showed that comet dust is a complex fine-grained mixture of silicates and organic material. A full understanding of comet dust will require detailed morphological, mineralogical, elemental and isotopic analysis at the finest possible scale. Electron microscopy and related microbeam techniques will play key roles in the analysis. The present and future of electron microscopy of comet samples involves laboratory study of micrometeorites collected in the stratosphere, in-situ SEM analysis of particles collected at a comet and laboratory study of samples collected from a comet and returned to the Earth for detailed study.

Cryo-TEM of amphiphilic polymer and amphiphile/polymer solutions

1993 ◽  
Vol 51 ◽  
pp. 876-877
Author(s):  
Yeshayahu Talmon
Keyword(s):  
Microstructural Characterization ◽  
Building Blocks ◽  
Quantitative Information ◽  
Physical Models ◽  
Specimen Preparation ◽  
Time Resolved ◽  
Temperature Changes ◽  
Temperature And Humidity ◽  
Microstructured Fluids ◽  
Air Streams

To achieve complete microstructural characterization of self-aggregating systems, one needs direct images in addition to quantitative information from non-imaging, e.g., scattering or Theological measurements, techniques. Cryo-TEM enables us to image fluid microstructures at better than one nanometer resolution, with minimal specimen preparation artifacts. Direct images are used to determine the “building blocks” of the fluid microstructure; these are used to build reliable physical models with which quantitative information from techniques such as small-angle x-ray or neutron scattering can be analyzed.To prepare vitrified specimens of microstructured fluids, we have developed the Controlled Environment Vitrification System (CEVS), that enables us to prepare samples under controlled temperature and humidity conditions, thus minimizing microstructural rearrangement due to volatile evaporation or temperature changes. The CEVS may be used to trigger on-the-grid processes to induce formation of new phases, or to study intermediate, transient structures during change of phase (“time-resolved cryo-TEM”). Recently we have developed a new CEVS, where temperature and humidity are controlled by continuous flow of a mixture of humidified and dry air streams.

Emotional Variability Predicts Tiredness in Daily Life

2016 ◽  
Vol 37 (3) ◽  
pp. 181-193 ◽  
Author(s):  
Aire Mill ◽  
Anu Realo ◽  
Jüri Allik
Keyword(s):  
Sampling Method ◽  
Daily Life ◽  
Emotional Experience ◽  
Experience Sampling ◽  
Experience Sampling Method ◽  
Building Blocks ◽  
Intraindividual Variability ◽  
Unique Role ◽  
Over Time

Abstract. Intraindividual variability, along with the more frequently studied between-person variability, has been argued to be one of the basic building blocks of emotional experience. The aim of the current study is to examine whether intraindividual variability in affect predicts tiredness in daily life. Intraindividual variability in affect was studied with the experience sampling method in a group of 110 participants (aged between 19 and 84 years) during 14 consecutive days on seven randomly determined occasions per day. The results suggest that affect variability is a stable construct over time and situations. Our findings also demonstrate that intraindividual variability in affect has a unique role in predicting increased levels of tiredness at the momentary level as well at the level of individuals.

Sign in / Sign up

Export Citation Format

Share Document