Universality of High-Strength Tensors

A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of variables. Using entirely different techniques, we extend this theorem to arbitrary polynomial functors. As a corollary of our work, we show that specialisation induces a quasi-order on elements in polynomial functors, and that among the elements with a dense orbit there are unique smallest and largest equivalence classes in this quasi-order.

Weak implicative filters in quasi-ordered residuated systems

The concept of residuated relational systems ordered under a quasiorder relation was introduced in 2018 by S. Bonzio and I. Chajda as a structure A = 〈A, ·,→, 1, R〉, where (A, ·) is a commutative monoid with the identity 1 as the top element in this ordered monoid under a quasi-order R. The author introduced and analyzed the concepts of filters and implicative filters in this type of algebraic structures. In this article, the concept of weak implicative filters in a quasi-ordered residuated system is introduced as a continuation of previous researches. Also, some conditions for a filter of such system to be a weak implicative filter are listed.

A study on orderings based on fuzzy quasi- order relations

This paper further studies orderings based on fuzzy quasi-order relations using fuzzy graph. Firstly, a fuzzy relation on a finite set is represented equivalently by a fuzzy graph. Using the graph, some new results on fuzzy relations are derived. In ranking those alternatives, we usually obtain a quasi-order relation, which often has inconsistencies, so it cannot be used for orderings directly. We need to remake it into a reasonable partial order relation for orderings. This paper studies these inconsistencies, and divides them into two types: framework inconsistencies and degree inconsistencies. For the former, a reasonable and feasible method is presented to eliminate them. To eliminate the latter, the concept of complete partial order relation is presented, which is more suitable than partial order relation to rank the alternatives. A method to obtain a reasonable complete partial order relation for a quasi-order relation is given also. An example is given as well to illustrate these discussions. Lastly, the paper discusses the connection between quasi-order relations and preference relations for orderings and some other related problems.

Implicative filters in quasi-ordered residuated systems

The concept of residuated relational systems ordered under a quasiorder relation was introduced in 2018 by S. Bonzio and I. Chajda as a structure 𝒜 = 〈A, ·,→, 1, R〉, where (A, ·) is a commutative monoid with the identity 1 as the top element in this ordered monoid under a quasi-order R. The author introduced and analyzed the concepts of filters in this type of algebraic structures. In this article, as a continuation of previous author’s research, the author introduced and analyzed the concept of implicative filters in quasi-ordered residuated systems.

Critical Properties and Complexity Measures of Read-Once Boolean Functions

In this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions can be characterized by a finite set of minimal subclasses of read-once functions, where this parameter is unbounded. We focus on two parameters related to certificate complexity and characterize each of them in the terminology of minimal classes.

Strong quasi-ordered residuated system

The concept of residuated relational systems ordered under a quasi-order relation was introduced in 2018 by S. Bonzio and I. Chajda. In such algebraic systems, we have introduced and developed the concepts of implicative and comparative filters. In addition, we have shown that every comparative filter is an implicative filter at the same time and that converse it does not have to be. In this article, as a continuation of previous research, we introduce the concept of strong quasi-ordered residuated systems and we show that in such systems implicative and comparative filters coincide. In addition, we show that in such systems the concept of least upper bound for any two pair of elements can be determined.

Model of Process Synchronization in Through Analysis

Synchronization of parallel processes of distributed information systems (DIS) has been largely determined by decisions taken at the stages of their design. Having already been in structural and functional models, when determining cause- and-effect relationships for events and actions in DIS components, it becomes necessary to coordinate them. In the proposed multilevel systemic, structural and functional synchronization model, a hierarchy of such causal relationships with interlevel mappings, inheritance and encapsulation of events and actions have been formed. The model has been also based on hierarchical extended Petri nets, which make it possible to represent various aspects of a special analysis of technical diagnostics, in particular, analysis of correctness, verification, testing, for the adopted display of the asynchronous-behavioral nature of the multilevel interaction of DIS processes. Features of the synchronization model include mapping operations for cross- level inheritance and encapsulations that synchronize events and actions, as well as end-to-end synchronized quasi-order relationships and compatibility for them. The synchronization model is also distinguished by the possibility of specializing its objects, operations and relations for the tasks of check and recognition of behavioral properties set for analysis and verification, basic in technical diagnostics, including in online and offline testing. The synchronization model has allowed one to determine the formal conditions for methods of end-to-end asynchronous coordination of events and actions of multi-level models, that represent design solutions for DIS, in particular, for technical diagnostics methods, and also to reduce the computational complexity of a special synchronization analysis due to an end-to-end decomposition approach. The dimension of the synchronization model has been estimated using the representation of Petri net graphs and special graphs of reachable states using list structures. The above estimates determine the limits of applicability of the formal synchronization model.

Phase Transitions in 1-Bromoadamantane Compared to 1-Chloroadamantane: Similarities and Unique Features

The elastic properties of 1-Chloroadamantane and 1-Bromoadamantane in order–disorder and order–quasi-order phase transitions at temperatures in the range of 77–305 K and high pressures up to 1.1 GPa are studied...

The critical temperature of the 2D-Ising model through deep learning autoencoders

We investigate deep learning autoencoders for the unsupervised recognition of phase transitions in physical systems formulated on a lattice. We focus our investigation on the 2-dimensional ferromagnetic Ising model and then test the application of the autoencoder on the anti-ferromagnetic Ising model. We use spin configurations produced for the 2-dimensional ferromagnetic and anti-ferromagnetic Ising model in zero external magnetic field. For the ferromagnetic Ising model, we study numerically the relation between one latent variable extracted from the autoencoder to the critical temperature Tc. The proposed autoencoder reveals the two phases, one for which the spins are ordered and the other for which spins are disordered, reflecting the restoration of the ℤ2 symmetry as the temperature increases. We provide a finite volume analysis for a sequence of increasing lattice sizes. For the largest volume studied, the transition between the two phases occurs very close to the theoretically extracted critical temperature. We define as a quasi-order parameter the absolute average latent variable z̃, which enables us to predict the critical temperature. One can define a latent susceptibility and use it to quantify the value of the critical temperature Tc(L) at different lattice sizes and that these values suffer from only small finite scaling effects. We demonstrate that Tc(L) extrapolates to the known theoretical value as L →∞ suggesting that the autoencoder can also be used to extract the critical temperature of the phase transition to an adequate precision. Subsequently, we test the application of the autoencoder on the anti-ferromagnetic Ising model, demonstrating that the proposed network can detect the phase transition successfully in a similar way. Graphical abstract