Projection-Iterative Methods for a Class of Difference Equations

We develop a theoretical framework for projection-iterative methods to solve operator equations of the form Au + Bu = f, where A is a Toeplitz operator in a Banach space , B is considered as a perturbation (of general form) of A, and f is a given element in this space. The methods are adopted for application to general situations, in particular, to the equations in which A need not be a Fredholm operator. The idea to involve iteration procedures and the technique which we apply allow to obtain conditions on perturbations for convergence and effective error estimates in terms of some weighted spaces (without any restrictions on the norms for perturbations). Based on established evaluations we derive further information about decaying properties of the solutions. The obtained results are illustrated by considering concrete classes of equations as, for instance, equations corresponding to Jacobi type operators.      

Fission fragment mass yields of Th to Rf even-even nuclei

Fission properties of the actinide nuclei are deduced from theoretical analysis. We investigate potential energy surfaces and fission barriers and predict the fission fragment mass yields of actinide isotopes. The results are compared with experimental data where available. The calculations were performed in the macroscopic-microscopic approximation with the Lublin-Strasbourg Drop (LSD) for the macroscopic part, and the microscopic energy corrections were evaluated in the Yukawa-folded potential. The Fourier nuclear shape parametrization is used to describe the nuclear shape, including the non-axial degree of freedom. The fission fragment mass yields of the nuclei considered are evaluated within a 3D collective model using the Born-Oppenheimer approximation.     

Discovery Through Gossip

We study randomized gossip‐based processes in dynamic networks that are motivated by information discovery in large‐scale distributed networks such as peer‐to‐peer and social networks. A well‐studied problem in peer‐to‐peer networks is resource discovery, where the goal for nodes (hosts with IP addresses) is to discover the IP addresses of all other hosts. Also, some of the recent work on self‐stabilization algorithms for P2P/overlay networks proceed via discovery of the complete network. In social networks, nodes (people) discover new nodes through exchanging contacts with their neighbors (friends). In both cases the discovery of new nodes changes the underlying network — new edges are added to the network — and the process continues in the changed network. Rigorously analyzing such dynamic (stochastic) processes in a continuously changing topology remains a challenging problem with obvious applications. This paper studies and analyzes two natural gossip‐based discovery processes. In the push discovery or triangulation process, each node repeatedly chooses two random neighbors and connects them (i.e., “pushes” their mutual information to each other). In the pull discovery process or the two‐hop walk, each node repeatedly requests or “pulls” a random contact from a random neighbor and connects itself to this two‐hop neighbor. Both processes are lightweight in the sense that the amortized work done per node is constant per round, local, and naturally robust due to the inherent randomized nature of gossip. Our main result is an almost‐tight analysis of the time taken for these two randomized processes to converge. We show that in any undirected n‐node graph both processes take rounds to connect every node to all other nodes with high probability, whereas is a lower bound. We also study the two‐hop walk in directed graphs, and show that it takes time with high probability, and that the worst‐case bound is tight for arbitrary directed graphs, whereas Ω(n²) is a lower bound for strongly connected directed graphs. A key technical challenge that we overcome in our work is the analysis of a randomized process that itself results in a constantly changing network leading to complicated dependencies in every round. We discuss implications of our results and their analysis to discovery problems in P2P networks as well as to evolution in social networks. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 48, 565–587, 2016     

Some results on Vizing’s conjecture and related problems

The well-known conjecture of Vizing on the domination number of Cartesian product graphs claims that for any two graphs $G$ and $H$, $\gamma \left(G\square H\right)\ge \gamma \left(G\right)\gamma \left(H\right)$. We disprove its variations on independent domination number and Barcalkin–German number, i.e. Conjectures 9.6 and 9.2 from the recent survey Bre?ar et al. (2012) [4]. We also give some extensions of the double-projection argument of Clark and Suen (2000) [8], showing that their result can be improved in the case of bounded-degree graphs. Similarly, for rainbow domination number we show for every $k\ge 1$ that ${\gamma }_{rk}\left(G\square H\right)\ge \frac{k}{k+1}\gamma \left(G\right)\gamma \left(H\right)$, which is closely related to Question 9.9 from the same survey. We also prove that the minimum possible counterexample to Vizing’s conjecture cannot have two neighboring vertices of degree two.     

An Asymptotic Ratio in the Complete Binary Tree

Let T _n be the complete binary tree of height n considered as the Hasse-diagram of a poset with its root 1 _n as the maximum element. For a rooted tree T, define two functions counting the embeddings of T into T _n as follows A(n;T)=|{S T _n  : 1 _n ∈S, S≅T}|, and B(n;T)=|{S T _n :1 _n ∉S, S≅T}|. In this paper we investigate the asymptotic behavior of the ratio A(n;T)/B(n;T), and we show that lim  _n→∞[A(n;T)/B(n;T)]=2^ℓ;−1−1, for any tree T with ℓ leaves. This revised version was published online in June 2006 with corrections to the Cover Date.     

Strong negation in intuitionistic style sequent systems for residuated lattices

We study the sequent system mentioned in the author's work 18 as CyInFL with ‘intuitionistic’ sequents. We explore the connection between this system and symmetric constructive logic of Zaslavsky 40 and develop an algebraic semantics for both of them. In contrast to the previous work, we prove the strong completeness theorem for CyInFL with ‘intuitionistic’ sequents and all of its basic variants, including variants with contraction. We also show how the defined classes of structures are related to cyclic involutive FL‐algebras and Nelson FL_ew‐algebras. In particular, we prove the definitional equivalence of symmetric constructive FL_ewc‐algebras (algebraic models of symmetric constructive logic) and Nelson FL_ew‐algebras (algebras introduced by Spinks and Veroff 33 , 34 as the termwise equivalent definition of Nelson algebras). Because of the strong completeness theorem that covers all basic variants of CyInFL with ‘intuitionistic’ sequents, we rename this sequent system to symmetric constructive full Lambek calculus (). We verify the decidability of this system and its basic variants, as we did in the case of their distributive cousins 18 . As a consequence we obtain that the corresponding theories of (distributive and nondistributive) symmetric constructive FL‐algebras are decidable.     

Highly enantioselective asymmetric reactions involving zinc ions promoted by chiral aziridine alcohols

Enantiomerically pure, chiral secondary and tertiary aziridine alcohols (including the aziridine analogue of ProPhenol—AziPhenol) have proven to be highly effective catalysts for enantioselective asymmetric reactions in the presence of zinc ions, including arylation of aromatic aldehydes, epoxidation of chalcone and addition of diethylzinc to aldehydes, leading to the desired chiral products in high chemical yields (up to 90%) and with ee’s up to 90%. A higher catalytic activity of Prophenol-type bis(aziridine alcohol) in the aforementioned asymmetric transformations has been demonstrated.     

A quantitative thermal analysis of cyclists’ thermo-active base layers

It is well known that clothes used in sporting activity are a barrier for heat exchange between the environment and athlete, which should help in thermoregulation improvement. However, it is difficult to evaluate which top is best for each athlete according to the characteristics of the sport. Researchers have tried to measure the athlete’s temperature distribution during exercise at the base layers of tops with different approaches. The aim of this case study was to investigate the use of thermography for thermo-active base layer evaluation. Six new base layers were measured on one cyclist volunteer during a progressive training on a cycloergometer. As a control condition, the skin temperature of the same volunteer was registered without any layer with the same training. A training protocol was selected approximate to cycling race, which started from the warm-up stage, next the progressive effort until the race finished and at the end “cool-down” stage was over. In order to show which layer provided the strongest and weakest barrier for heat exchange in comparison with environment, the temperature parameters were taken into consideration. The most important parameter in the studies was the temperature difference between the body and the layers, which was changing during the test time. The studies showed a correlation between the ergometer power parameter and the body temperature changes, which has a strong and significant value. Moreover, the mass of every layer was checked before and after the training to evaluate the mass of the sweat exuded during the test. From this data, the layer mass difference parameter was calculated and taken into consideration as a parameter, which may correspond with the mean heart rate value from each training. A high and positive correlation coefficient was obtained between the average heart rate and the mass difference for the base layers. Thermal analysis seems to have a new potential application in the objective assessment of sports clothing and may help in choosing the proper clothes, which could support heat transfer during exercising and protect the body from overheating.