Unsolvable Problems Research Articles

RESULTS OF HONEY BEE COLONY LOSSES MONITORING IN UKRAINE IN THE CONDITIONS OF WAR AFTER THE WINTER OF 2022-2023

Losses of Western honey bee colonies (Apis mellifera L.) represent a globally significant phenomenon with profound ecological and economic implications, yet the underlying causes remain a subject of ongoing investigation (Insolia et al., 2022). This study aimed to evaluate colony losses following the 2022–2023 wintering season in Ukraine in the conditions of the ongoing war, as part of the annual international monitoring effort coordinated by the COLOSS. The survey was conducted employing the standardized COLOSS protocol and covered all physiographic zones of Ukraine except for the Crimean Mountains, with data from 751 valid protocols synthesized for analysis. The average overall loss rate after the 2022-2023 wintering season in Ukraine was 10.8 %, slightly exceeding the previous year's rate (8.9% after the 2021-2022 wintering season). Notably, the loss of bee colonies (6.55 %) nearly doubled compared to the previous year (3.72% after the 2021-2022 wintering season), while losses due to unsolvable queen problems (3.07 %) remained consistent with the previous year (3.07% after the 2021-2022 wintering season), and losses attributable to adverse natural phenomena (1.27%) decreased by over 1.5 times (2.08% after the 2021-2022 wintering season). The highest overall loss rate of bee colonies was observed in the steppe zone (17.0%), with significantly lower losses in the Ukrainian Carpathians (7.3%), mixed (8.6%), and broad-leaved (9.0%) forest zones. The distribution of loss components across different physiographic zones mirrored the national trend: dead/missing colonies (4.19 % - 10.13 %), unresolved queen issues (2.16 % - 5.24 %), losses due to adverse natural events (0.74 % - 1.85 %). Among the reported characteristics of lost colonies, starvation-induced mortality (19 %) and unexplained bee deaths (17.8 %) were most frequently cited, while bee disappearances (9.1%) and dead bees within hives despite available food (10.4 %) were less common. Over 12% of analysed beekeeping operations were situated in areas affected by armed conflict, with some experiencing direct damage to apiaries (2.4%) and associated equipment (0.1% - 0.5%). Once again, the inverse relationship between apiary size and total losses was reaffirmed, though no correlations between colony losses and migratory beekeeping were identified. 76.4 % of respondents monitored their colonies for Varroa mite infestations, with 97.5% treating for varroosis. Notably, 19.6% of respondents treated their colonies without prior monitoring of mite infestation levels. Amitraz-based veterinary products remained the most commonly used acaricides in Ukraine, applied through fumigation or aerosols (32.2 %) and strips (21.7 %). Additionally, 22.9 % of surveyed beekeepers practiced drone brood removal. The applying of traditional beekeeping methods increased (10,4% this year, compared to 2.18 % and 3.60 % before the wintering seasons of 2020-2021 and 2019-2020, respectively). Keywords: honey bee, Apis mellifera, colony losses, monitoring, mortality, beekeeping, varroosis

Epitope delimitation: A new method for defining epitopes of human IgG-reactive antigenic peptides based on rabbit-recognized epitope motifs.

The use of precise epitope peptides as antigens is essential for accurate serological diagnosis of viral-infected individuals, but now it remains an unsolvable problem for mapping precise B cell epitopes (BCEs) recognized by human serum. To address this challenge, we propose a novel epitope delimitation (ED) method to uncover BCEs in the delineated human IgG-reactive (HR) antigenic peptides (APs). Specifically, the method based on the rationale of similarities in humoral immune responses between mammalian species consists of a pair of elements: experimentally delineated HR-AP and rabbit-recognized (RR) BCE motif and corresponding pair of sequence alignment analysis. As a result of using the ED approach, after decoding four RR-epitomes of human papillomavirus types 16/18-E6 and E7 proteins utilizing rabbit serum against each recombinant protein and sequence alignment analysis of HR-APs and RR-BCEs, 19 fine BCEs in 17 of 22 known HR-APs were defined based on each corresponding RR-BCE motifs, including the type-specificity of each delimited BCE in homologous proteins. The test with 22 known 16/20mer HR-APs demonstrated that the ED method is effective and efficient, indicating that it can be used as an alternative method to the conventional identification of fine BCEs using overlapping 8mer peptides.

Генерически неразрешимые и трудноразрешимые проблемы

The generic-case approach to algorithmic problems examines the behavior of an algorithm on typical (almost all) inputs and ignores the rest of the inputs. The method of generic amplification was proposed by A. Myasnikov and author for constructing of generically undecidable problems. The main ingredient of this method is the cloning technique, which combines the input data of a problem into sufficiently large sets of equivalent input data. Equivalence is understood in the sense that the problem is solved in the same way for them. We present a generalization of this method. We also construct a problem that is decidable in the classical sense, but which is not generically decidable in polynomial time. We use a different method to generic amplification, because generic amplification is unlikely to be applicable here.

Method of encryption in the MST3 cryptosystem based on Automorphisms group of Suzuki's functional field

This article presents a new implementation of encryption based on MST, focused on generalized Suzuki 2-groups. The well-known MST cryptosystem, based on Suzuki groups, is constructed using a logarithmic signature at the center of the group, leading to a large array of logarithmic signatures. The proposed encryption is based on multi-parameter noncommutative groups, with a focus on the generalized multi-parameter Suzuki 2-group. This approach responds to the progress in the development of quantum computers, which may pose a threat to the security of many open cryptosystems, especially those based on factorization problems and discrete logarithms, such as RSA or ECC. The use of noncommutative groups to create quantum-resistant cryptosystems has been a known approach for the last two decades.
 The unsolvable word problem, proposed by Wagner and Magyarik, is used in the field of permutation groups and is key to the development of cryptosystems. Logarithmic signatures, introduced by Magliveras, represent a unique type of factorization suitable for finite groups. The latest version of such an implementation, known as MST3, is based on the Suzuki group. In 2008, Magliveras introduced the LS transitivity limit for the MST3 cryptosystem, and later Swaba proposed an improved version of the cryptosystem, eMST3. In 2018, T. van Trung suggested applying the MST3 approach using strong aperiodic logarithmic signatures for abelian p-groups. Kong and his colleagues conducted a deep analysis of MST3 and noted that due to the absence of publications on the quantum vulnerability of this algorithm, it can be considered a potential candidate for use in the post-quantum era.
 The main distinction of the new system is the use of homomorphic encryption to construct logarithmic signature coverings for all group parameters, which improves the secrecy of the cryptosystem, particularly against brute-force attacks.

Analysis of data‐driven models for predicting fatigue strength of steel components with uncertainty quantification

AbstractMaterial informatics has emerged as a valuable research field in material science, providing solutions to previously unsolvable problems or accelerating deliverables. Fatigue failure, as a complex and non‐deterministic phenomenon, requires a probabilistic approach to assess the uncertainty of the fatigue strength prediction. This study compares various probabilistic data‐driven models for credible fatigue strength predictions for three distinct steel groups. The analysis considers data and model uncertainty, evaluating their impacts on predictive quality from engineering and data science perspectives. Results reveal that deep ensembles outperform other probabilistic models regarding negative log‐likelihood (NLL), while random forest exhibits the lowest root mean square error (RMSE). Notably, the prediction accuracy of case‐hardened steels is negatively affected by insufficient material properties definitions, while stainless steels demonstrate the best performance compared to other steel types.

Intelligence tests and the individual: Unsolvable problems with validity and reliability

IQ scores are used in the Netherlands to determine whether an individual qualifies for special education or has access to healthcare. The term for this use of IQ is referred to as “slagboomdiagnostiek” (doorway diagnostics). Criticism has been voiced from the professional field regarding this policy. In this article, we will discuss whether the current Dutch policy is justified by examining the validity and reliability of IQ tests. Specifically, we will address whether the IQ test can be used in clinical decision-making regarding the individual. We argue that while the validity and reliability have been demonstrated at a group level, they do not hold true for the individual, leading to the conclusion that the current Dutch policy is not justified.

How to Draw on Narrative to Mitigate Ageism.

Ageism is so structurally integrated and normalized in US health care that it is generally unnoticed by clinicians, despite its effects on the medical care and lives of older adults. Clinicians often lack time, incentives, and opportunities to pause and fully consider the perspective of older adults, especially those with mental illness. As a result, clinicians might infantilize older adults and pathologize or dismiss their preferences, values, and capacity for growth. This commentary on a case proposes a narrative-based ethical approach to shift clinicians' perception of older adults as suffering from the inevitable and unsolvable problems of aging to experiencing a need for dignity and the possibility of continued personal growth.

Method of encryption in the MST3 cryptosystem based on Automorphisms group of Suzuki's functional field

This article presents a new encryption method based on the group of automorphisms of Suzuki's functional field, which enhances the security level of the existing MST3 cryptosystem. This approach is a response to the progress in developing powerful quantum computers, which can threaten the security of many public-key encryption systems, particularly those based on factorization and discrete logarithm problems, such as RSA or ECC. Using non-commutative groups to create quantum-resistant cryptosystems has been a known approach over the last two decades. The unsolvable word problem, proposed by Wagner and Magyarik, applied in the realm of permutation groups, is key to the development of cryptosystems. Logarithmic signatures, introduced by Magliveras, represent a unique type of factorization suitable for finite groups. The latest version of such implementation, known as MST3, is based on the Suzuki group. In 2008, Magliveras presented the LS limit of transitivity for the MST3 cryptosystem. Later, Svaba proposed an improved version of the cryptosystem eMST3 with enhanced protective features, including secret homomorphic covering. In 2018, T. van Trung suggested the application of the MST3 approach using strong aperiodic logarithmic signatures for Abelian p-groups. Kong and his colleagues conducted an in-depth analysis of MST3 and noted that due to the lack of publications on the quantum vulnerability of this algorithm, it can be considered as a potential candidate for use in the post-quantum era. One of the key ideas is to increase encryption efficiency by optimizing computational resources, particularly through reducing the size of the key space. This method is applied to the calculations of logarithmic signatures within the group. It was implemented over finite fields of small sizes.

Undecidable problems in quantum field theory

Undecidable problems in quantum field theory

Classical Solutions for Quantum Challenges: An Introduction to Postquantum Cryptography

Quantum computing has tremendous potential to change the world by solving many previously unsolvable problems. However, with this tremendous computational power comes threats to our existing technologies safeguarding the world's communication channels and data storage. Specifically, it threatens our standardized and widely deployed cryptographic systems that are in use today. These existing cryptosystems are based on mathematical techniques that are difficult (essentially infeasible) for a classical computer to solve. Quantum computing presents a threat since many previously infeasible problems are likely to become feasible or even easy to solve by a quantum computer. This paper briefly reviews quantum computing and its properties before studying related work into postquantum cryptography. The eventuality of quantum computing is discussed based on readily available research and public information, in addition to expert opinion, which then provides insight into the eventuality of postquantum cryptography and the validity of action, or inaction, around this research. Further topics focus on the standardization of postquantum cryptosystems, and future research trends and opportunities in the field of postquantum cryptography.

Introducing a Research Programme for Quantum Humanities: Theoretical Implications

AbstractQuantum computing is a form of computing based on the principles of quantum mechanics. Quantum computing promises to revolutionise society through technological solutions to previously unsolvable problems or by enhancing the capacities of current computational technologies. Additionally, quantum computing has the potential to revolutionise the humanities and social sciences. We denote the study of these changes as “quantum humanities”, whose study focuses on the potential of quantum computing. This paper proposes a research programme for quantum humanities, which includes the application of quantum algorithms to humanities research, reflection on the methods and techniques of quantum computing and evaluation of its potential societal implications. Moreover, we argue that, foundationally, quantum mechanics has serious implications for the ways in which data and information are used to produce seemingly objective technologies. Thus, quantum computing is a nexus for the study of knowledge itself. This research programme aims to define the field of quantum humanities and to establish it as a meaningful part of the humanities and social sciences.

Near-Polynomial Recursive Sequences with Algorithmically Unsolvable Problems

Near-Polynomial Recursive Sequences with Algorithmically Unsolvable Problems

Comment on “Simultaneous density and thermal conductivity depth profile reconstructions from noised thermal-wave amplitude and phase data using a combined integral-equation and imperialist competitive algorithm method” [J. Appl. Phys. 133, 055102 (2023)

In a recent paper, Mandelis et al. [J. Appl. Phys. 133, 055102 (2023)] describe a photothermal methodology and a new inversion technique which, when applied to a heterogeneous material, is claimed to allow a simultaneous reconstruction of the depth profiles of thermal conductivity and density (assuming that the specific heat is a known constant). In this Comment we recall that, for the thermophysical configuration considered, the thermal conductivity and volumetric heat capacity profiles cannot be identified simultaneously because they are fully correlated. The exposed problem exhibits unconditional non-identifiability leading to the non-uniqueness of the solution. The apparent success of the inversion tests does not preclude the fact that, for any (apparently) optimal solution, an infinite multiplicity of equally satisfactory pairs of conjugate profiles can be built. The simultaneous identification of the density and thermal conductivity profiles is here an unsolvable inverse problem.

Application of Hamming Code Theory in Prisoner 's Chessboard Puzzle

This work proposed a universal algorithm based on the parity-check theory of Hamming code for solving the Prisoner's Chessboard Puzzle (PCP) which is known as an unsolvable mathematical problem. The solution to the simplest two-dimensional PCP is first given. However, no suitable strategy is available when the 3D PCP is transformed into a 3D cube coloring problem. To explore the existence and structure of the solution of PCP, we make the rows of the whole chessboard into a line and then uses the idea of Hamming code parity check. After proving the agreement of parity check results and XOR operation ones, we carry out XOR operation to get a universal solution for PCP. The results show that the method can solve any dimension PCP effectively.

The challenge of regionalist institutions without regionalist politics

Abstract Scholarship on regionalist institutions lacks a theory of regionalist politics because we lack regional political parties, without which regional politics is difficult. Particularly in the United States, regional governments are the product of either intergovernmental agreements between governments controlled by ostensibly national parties or state statutes and federal grants administered by ostensibly nonpartisan bureaucrats. The absence of truly regionalist politics and parties creates problems for governmental problem-solving at both the national and regional levels. First, politics abhors a vacuum: In the absence of truly regionalist parties, politics generates semi-regionalized parties that risk hindering national policymaking with the parochial outlook of the semi-regionalized politicians. Second, regional politics are important tools for organizing both legislators and voters to pursue regionally controversial ends requiring political compromise. National parties organized around national issues cannot perform this function at the regional level. Without regional parties organized around issues like overcoming NIMBY (“not-in-my-backyard”) resistance to housing, for instance, it is difficult to rally politicians to take politically costly positions on those issues. This Article aims to solve the problem of missing regionalist parties and politics in two steps—first, with a taxonomy of regional governments and regionalist and semi-regionalist parties along with their respective benefits and burdens, and second, with very modest suggestions for promoting regionalist and discouraging semi-regionalist, parties. None of these solutions is perfect. Genuinely regionalist democracy presents an unsolvable problem, resulting from the inevitable cognitive limits of voters and the organizational incentives of politicians at every level of government.

Similar wisdom strategies for different life problems

Wisdom can be understood as the ability to solve unsolvable problems. Wise persons are better in coping with difficult life situations. Wise strategies help them to do so. The question is whether the same or different wisdom strategies make sense for different life problems. A total of 416 persons (40.4 years old) read two situational vignettes, one about a work problem and one about a private problem. After each situational vignette, they were asked about their wisdom strategies regarding the respective situation. Wisdom strategies were measured by means of a self-rating wisdom scale. People agreed similarly with wisdom strategies for both situations. For both situations, participants agreed most strongly to use factual and procedural knowledge, perception and acceptance of emotions, value relativism and relativization of problems and aspirations. The order of the remaining eight wisdom strategies was the same for both situations. People agreed similarly with wisdom strategies regardless of the situation type. Wisdom strategies seem to be meaningful across different life problems. This is of interest for the design of interventions to promote psychological resilience.

Many bounded versions of undecidable problems are NP-hard

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems, such as the halting problem, the tiling problem, the Post correspondence problem or the matrix mortality problem. All these problems have a common property: they have an NP-hard bounded version. This work establishes a relation between undecidable unbounded problems and their bounded NP-hard versions. Specifically, we show that NP-hardness of a bounded version follows easily from the reduction of the unbounded problems. This leads to new and simpler proofs of the NP-hardness of bounded version of the Post correspondence problem, the matrix mortality problem, the positivity of matrix product operators, the reachability problem, the tiling problem, and the ground state energy problem. This work sheds light on the intractability of problems in theoretical physics and on the computational consequences of bounding a parameter.

Post-Quantum Signature Scheme Based on the Root Extraction Problem over Mihailova Subgroups of Braid Groups

In this paper, by introducing an isomorphism from the Mihailova subgroup of F2×F2 to the Mihailova subgroups of a braid group, we give an explicit presentation of Mihailova subgroups of a braid group. Hence, in a braid group, there are some Mihailova subgroups experiencing unsolvable subgroup membership problem. Based on this, we propose a post-quantum signature scheme of the Wang–Hu scheme, and we show that the signature scheme is free of quantum computational attack.

Use of fibrin glue in the treatment of decubital ulcers in patients after brain damage, as a stage of conservative treatment

BACKGROUND: Patients with brain damage require specific treatment for decubitus ulcers. Given the seriousness of their condition and decompensation of concomitant pathology, surgical treatment is not always possible. Conservative therapy can take a long time, which is aggravated by the unsolvable problem of patient immobilization, microcirculatory tissue disorders, and inevitable chronicity of the purulentinflammatory process. Most authors and practitioners are inclined toward a combined approach in the treatment of decubitus ulcers. AIM: To evaluate the results of using fibrin glue in the treatment of bedsores in patients with severe brain damage. MATERIALS AND METHODS: The article presents the experience of using fibrin glue in the conservative treatment of bedsores. The study included patients in a chronic critical state because of severe brain damage, with a decubitus ulcers area of 80 cm2 (stage III according to the Agency For Health Care Policy and Research classification). In the main group, treatment included the use of fibrin glue in accordance with the Russian Federation Patent No. 2777483 dated 08/04/2022. In the control group, treatment included standard dressings with levomekol ointment. Both groups received treatment for 21 days. Changes in the wound process were assessed using the BatesJensen scale and cytological examination at control points. RESULTS: The study analyzed 58 patients, who were divided into two groups: group 1 (main) included 32 patients (15 men, 17 women), and group 2 (control) included 26 patients (12 women, 14 men). In the main group, after 1 week of applying dressings with fibrin glue, positive changes were noted, such as active marginal epithelialization, disappearance of undermining and swelling of wound edges, appearance of juicy bright granulations, and absence of exudates. After 22.5 weeks, epithelialization exceeded 50% of the total area of the decubitus ulcers (56.2% of cases), and exudation was completely absent. In a cytological study, the percentage of cells responsible for tissue proliferation increased and inflammation decreased in the main group. No significant effect was noted in the control group. In 7.7% of cases, 50% epithelialization was noted on days 2835; in three patients, re-infection of the decubitus ulcers occurred, and ischemia developed, which significantly lengthened the total duration of inpatient treatment and rehabilitation by 1.01.5 months. CONCLUSION: The use of fibrin glue promotes decubitus ulcers epithelization, thereby reducing their size, up to complete healing.

Construction of a three-parameter encryption scheme on Hermitian groups in the MST3 cryptosystem

The article proposes a method for constructing a three-parameter encryption scheme based on Hermitian groups, which improves the security parameters of the existing MST3 cryptosystem. The challenge of improving existing approaches to building cryptosystems is driven by successes in building a quantum computer with sufficient computing power to render many public-key cryptosystems insecure. In particular, we are talking about those cryptosystems based on the complexity of factorization or the discrete logarithm problem, such as RSA, ECC, etc. There are several proposals that have become classic over the past almost 20 years for using non-commutative groups to build quantum-resistant cryptosystems The unsolvable word problem is an interesting area of research for cryptosystem construction. It was formulated by Wagner and Magyarik and lies in the plane of application of permutation groups. Logarithmic signatures (LS) were proposed by Magliveras. In this context, the logarithmic signature is a special type of factorization, it is applied to finite groups. The latest version of this implementation is known as MST3 and is based on the Suzuki group.
 In 2008, Magliveras demonstrated a transitive limit of LS for the MST3 cryptosystem. Svaba later proposed the eMST3 cryptosystem with improved security options. A secret homomorphic cover was added for this improvement. Then, in 2018, T. van Trung proposed an MST3 approach using strong aperiodic LS for abelian p-groups. Kong and colleagues conducted an extensive analysis of MST3 and noted that since there are no publications yet on the quantum vulnerability of the algorithm, it can be considered a candidate for the post-quantum era.
 One valuable idea is to improve encryption efficiency by optimizing the computational overhead. This is done while reducing the large size of the key space. This approach can be applied to LS calculations outside the center of the group. And this was done over the final fields of the small dimensions using groups with high order.