Search

For an integer k ≥ 2 , let (P n (k)) n be the k-generalized Pell sequence which starts with 0 , ... , 0 , 1 (k terms), and each term afterwards is given by P n (k) = 2 P n − 1 (k) + P n − 2 (k) + ⋯ + P n − k (k) . In this paper, we determine all solutions of the Markov equation x 2 + y 2 + z 2 = 3 x y z , with x, y, and z being k-generalized Pell numbers. This paper continues and extends a previous work of Kafle, Srinivasan and Togbé, who found all Markov triples with Pell components. [ABSTRACT FROM AUTHOR]

We consider a general metric Steiner problem, which involves finding a set S with the minimal length, such that S ∪ A is connected, where A is a given compact subset of a given complete metric space X; a solution is called the Steiner tree. Paolini, Stepanov, and Teplitskaya in 2015 provided an example of a planar Steiner tree with an infinite number of branching points connecting an uncountable set of points. We prove that such a set can have a positive Hausdorff dimension, which was an open question (the corresponding tree exhibits self-similar fractal properties). [ABSTRACT FROM AUTHOR]

This paper revisits a combinatorial structure called the large set of ordered design ( L O D ). Among others, we introduce a novel structure called Latin matching and prove that a Latin matching of order n leads to an L O D (n − 1 ,   n ,   2 n − 1) ; thus, we obtain constructions for L O D (1 ,   2 ,   3) , L O D (2 ,   3 ,   5) , and L O D (4 ,   5 ,   9) . Moreover, we show that constructing a Latin matching of order n is at least as hard as constructing a Steiner system S (n − 2 ,   n − 1 ,   2 n − 2) ; therefore, the order of a Latin matching must be prime. We also show some applications in multiagent systems. [ABSTRACT FROM AUTHOR]

In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph. [ABSTRACT FROM AUTHOR]

In this manuscript, some similar tripled fixed point results under certain restrictions on a b − metric space endowed with graphs are established. Furthermore, an example is provided to support our results. The obtained results extend, generalize, and unify several similar significant contributions in the literature. Finally, to further extend our results, the existence of a solution to a system of ordinary differential equations with infinite delay is derived. [ABSTRACT FROM AUTHOR]

Consider the following problem. In a school with three classes containing n students each, given that their genders are unknown, find the minimum possible number of triples of same-gender students—not all of which are from the same class. Muaengwaeng asked this question and conjectured that the minimum scenario occurs when the classes are all boys, all girls and half-and-half. In this paper, we solve many generalizations of the problem including when the school has more than three classes, when triples are replaced by groups of larger sizes, when the classes are of different sizes, and when gender is replaced by other non-binary attributes. [ABSTRACT FROM AUTHOR]

In this paper, the results of a quadruple coincidence point (QCP) are established for commuting mapping in the setting of fuzzy metric spaces (FMSs) without using a partially ordered set. In addition, several related results are presented in order to generalize some of the prior findings in this area. Finally, to support and enhance our theoretical ideas, non-trivial examples and applications for finding a unique solution for Lipschitzian and integral quadruple systems are discussed. [ABSTRACT FROM AUTHOR]

Connectivity has significance in both of data collection and aggregation for Wireless Sensor Networks (WSNs). Once the connectivity is lost, relay nodes are deployed to build a Steiner Minimal Tree (SMT) such that the inter-component connection is reestablished. In recent years, there has been a growing interest in connectivity restoration problems. In previous works, the deployment area of a WSN is assumed to be flat without obstacles. However, such an assumption is not realistic. In addition, most of the existing strategies chose the representative of each component, which serves as the starting point of relay node deployment during the connectivity restoration, either in a random way or in the shortest-distance based manner. In fact, both ways of representative selection could potentially increase the length of the SMT such that more relay nodes are required. In this paper, a novel connectivity restoration strategy is proposed--Obstacle-Avoid connectivity restoration strategy based on Straight Skeletons (OASS), which employs both the polygon based representative selection with the presence of obstacles and the straight skeleton based SMT establishment. The OASS is proved to be a 3-opt approximation algorithm with the complexity of O(n log n), and the approximation ratio can reduce to 3 p 3 2 while it satisfies a certain condition. The theoretical analysis and simulations show that the performance of the OASS is better than other strategies in terms of the relay count and the quality of the established topology (i.e., distances between components, delivery latency and balanced traffic load) as well. [ABSTRACT FROM AUTHOR]

Given a seven-element set X = {1, 2, 3, 4, 5, 6, 7}, there are 30 ways to define a Fano plane on it. Let us call a line of such a Fano plane--that is to say an unordered triple from X--ordinary or defective, according to whether the sum of two smaller integers from the triple is or is not equal to the remaining one, respectively. A point of the labeled Fano plane is said to be of the order s, 0 ≤ s ≤ 3, if there are s defective lines passing through it. With such structural refinement in mind, the 30 Fano planes are shown to fall into eight distinct types. Out of the total of 35 lines, nine ordinary lines are of five different kinds, whereas the remaining 26 defective lines yield as many as ten distinct types. It is shown that no labeled Fano plane can have all points of zero-th order, or feature just one point of order two. A connection with prominent configurations in Steiner triple systems is also pointed out. [ABSTRACT FROM AUTHOR]

In this paper, first we establish the explicit relation between 3-derivations and 3- automorphisms of a Lie algebra using the differential and exponential map. More precisely, we show that the Lie algebra of 3-derivations is the Lie algebra of the Lie group of 3-automorphisms. Then we study the derivations and automorphisms of the standard embedding Lie algebra of a Lie triple system. We prove that derivations and automorphisms of a Lie triple system give rise to derivations and automorphisms of the corresponding standard embedding Lie algebra. Finally we compute the 3-derivations and 3-automorphisms of 3-dimensional real Lie algebras. [ABSTRACT FROM AUTHOR]

In this paper, a tripled fractional differential system is introduced as three associated impulsive equations. The existence investigation of the solution is based on contraction principle and measures of noncompactness in terms of tripled fixed point and modulus of continuity. Our results are valid for both Kuratowski and Hausdorff measures of noncompactness. As an application, we apply the obtained results to a control problem. [ABSTRACT FROM AUTHOR]

We consider an abstract system consisting of the parabolic-type system of hemivariational inequalities (SHVI) along with the nonlinear system of evolution equations in the frame of the evolution triple of product spaces, which is called a system of differential hemivariational inequalities (SDHVI). A hybrid iterative system is proposed via the temporality semidiscrete technique on the basis of the Rothe rule and feedback iteration approach. Using the surjective theorem for pseudomonotonicity mappings and properties of the partial Clarke's generalized subgradient mappings, we establish the existence and priori estimations for solutions to the approximate problem. Whenever studying the parabolic-type SHVI, the surjective theorem for pseudomonotonicity mappings, instead of the KKM theorems exploited by other authors in recent literature for a SHVI, guarantees the successful continuation of our demonstration. This overcomes the drawback of the KKM-based approach. Finally, via the limitation process for solutions to the hybrid iterative system, we derive the solvability of the SDHVI with no convexity of functions u ↦ f l (t , x , u) , l = 1 , 2 and no compact property of C 0 -semigroups e A l (t) , l = 1 , 2 . [ABSTRACT FROM AUTHOR]

The symmetry SU(2) and its geometric Bloch Sphere rendering have been successfully applied to the study of a single qubit (spin-1/2); however, the extension of such symmetries and geometries to multiple qubits—even just two—has been investigated far less, despite the centrality of such systems for quantum information processes. In the last two decades, two different approaches, with independent starting points and motivations, have been combined for this purpose. One approach has been to develop the unitary time evolution of two or more qubits in order to study quantum correlations; by exploiting the relevant Lie algebras and, especially, sub-algebras of the Hamiltonians involved, researchers have arrived at connections to finite projective geometries and combinatorial designs. Independently, geometers, by studying projective ring lines and associated finite geometries, have come to parallel conclusions. This review brings together the Lie-algebraic/group-representation perspective of quantum physics and the geometric–algebraic one, as well as their connections to complex quaternions. Altogether, this may be seen as further development of Felix Klein's Erlangen Program for symmetries and geometries. In particular, the fifteen generators of the continuous SU(4) Lie group for two qubits can be placed in one-to-one correspondence with finite projective geometries, combinatorial Steiner designs, and finite quaternionic groups. The very different perspectives that we consider may provide further insight into quantum information problems. Extensions are considered for multiple qubits, as well as higher-spin or higher-dimensional qudits. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing hypercycle systems of 5-cycles in complete 3-uniform hypergraphs. A hypercycle system C (r , k , v) of order v is a collection of r-uniform k-cycles on a v-element vertex set, such that each r-element subset is an edge in precisely one of those k-cycles. We present cyclic hypercycle systems C (3 , 5 , v) of orders v = 25 , 26 , 31 , 35 , 37 , 41 , 46 , 47 , 55 , 56 , a highly symmetric construction for v = 40 , and cyclic 2-split constructions of orders 32 , 40 , 50 , 52 . As a consequence, all orders v ≤ 60 permitted by the divisibility conditions admit a C (3 , 5 , v) system. New recursive constructions are also introduced. [ABSTRACT FROM AUTHOR]

Given a homogeneous ideal I ⊆ k [ x 0 , ... , x n ] , the Containment problem studies the relation between symbolic and regular powers of I, that is, it asks for which pairs m , r ∈ N , I (m) ⊆ I r holds. In the last years, several conjectures have been posed on this problem, creating an active area of current interests and ongoing investigations. In this paper, we investigated the Stable Harbourne Conjecture and the Stable Harbourne–Huneke Conjecture, and we show that they hold for the defining ideal of a Complement of a Steiner configuration of points in P k n . We can also show that the ideal of a Complement of a Steiner Configuration of points has expected resurgence, that is, its resurgence is strictly less than its big height, and it also satisfies Chudnovsky and Demailly's Conjectures. Moreover, given a hypergraph H, we also study the relation between its colourability and the failure of the containment problem for the cover ideal associated to H. We apply these results in the case that H is a Steiner System. [ABSTRACT FROM AUTHOR]

Beimel et al. in CCC 12' put forward a paradigm for constructing Private Information Retrieval (PIR) schemes, capturing several previous constructions for k ≥ 3 servers. A key component in the paradigm, applicable to three-server PIR, is a share conversion scheme from corresponding linear three-party secret sharing schemes with respect to a certain type of "modified universal" relation. In a useful particular instantiation of the paradigm, they used a share conversion from (2 , 3) -CNF over Z m to three-additive sharing over Z p β for primes p 1 , p 2 , p where p 1 ≠ p 2 and m = p 1 · p 2 . The share conversion is with respect to the modified universal relation C S m . They reduced the question of whether a suitable share conversion exists for a triple (p 1 , p 2 , p) to the (in)solvability of a certain linear system over Z p . Assuming a solution exists, they also provided a efficient (in m , log p ) construction of such a sharing scheme. They proved a suitable conversion exists for several triples of small numbers using a computer program; in particular, p = p 1 = 2 , p 2 = 3 yielded the three-server PIR with the best communication complexity at the time. This approach quickly becomes infeasible as the resulting matrix is of size Θ (m 4) . In this work, we prove that the solvability condition holds for an infinite family of (p 1 , p 2 , p) 's, answering an open question of Beimel et al. Concretely, we prove that if p 1 , p 2 > 2 and p = p 1 , then a conversion of the required form exists. We leave the full characterization of such triples, with potential applications to PIR complexity, to future work. Although larger (particularly with m a x (p 1 , p 2) > 3 ) triples do not yield improved three-server PIR communication complexity via BIKO's construction, a richer family of PIR protocols we obtain by plugging in our share conversions might have useful properties for other applications. Moreover, we hope that the analytic techniques for understanding the relevant matrices we developed would help to understand whether share conversion as above for C S m , where m is a product of more than two (say three) distinct primes, exists. The general BIKO paradigm generalizes to work for such Z m 's. Furthermore, the linear condition in Beimel et al. generalizes to m's, which are products of more than two primes, so our hope is somewhat justified. In case such a conversion does exist, plugging it into BIKO's construction would lead to major improvement to the state of the art of three-server PIR communication complexity (reducing Communication Complexity (CC) in correspondence with certain matching vector families). [ABSTRACT FROM AUTHOR]

In this paper, we explore the algebra structure based on neutrosophic quadruple numbers. Moreover, two kinds of degradation algebra systems of neutrosophic quadruple numbers are introduced. In particular, the following results are strictly proved: (1) the set of neutrosophic quadruple numbers with a multiplication operation is a neutrosophic extended triplet group; (2) the neutral element of each neutrosophic quadruple number is unique and there are only sixteen different neutral elements in all of neutrosophic quadruple numbers; (3) the set which has same neutral element is closed with respect to the multiplication operator; (4) the union of the set which has same neutral element is a partition of four-dimensional space. [ABSTRACT FROM AUTHOR]