Wyszukiwarka
Filtry
wszystkich: 14
Wyniki wyszukiwania dla: EXTREMAL PROBLEMS
-
Systems of boundary value problems of advanced differential equations
PublikacjaThis paper considers the existence of extremal solutions to systems of advanced differential equations with corresponding nonlinear boundary conditions. The monotone iterative method is applied to obtain the existence results. An example is provided for illustration.
-
Monotone iterative method to second order differential equations with deviating arguments involving Stieltjes integral boundary conditions
PublikacjaWe use a monotone iterative method for second order differential equations with deviating arguments and boundary conditions involving Stieltjes integrals. We establish sufficient conditions which guarantee that such problems have extremal solutions in the corresponding region bounded by lower and upper solutions. We also discuss the situation when problems have coupled quasi-solutions. We illustrate our results by three examples.
-
Monotone iterative method for first-order differential equations at resonance
PublikacjaThis paper concerns the application of the monotone iterative technique for first-order differential equations involving Stieltjes integrals conditions. We discuss such problems at resonance when the measure in the Stieltjes integral is positive and also when this measure changes the sign. Sufficient conditions which guarantee the existence of extremal, unique and quasi-solutions are given. Three examples illustrate the results.
-
First-order differential equations with nonlocal boundary conditions
PublikacjaWe study a first-order boundary value problem subject to some boundary conditions given by Riemann-Stieltjes integrals. Using a monotone iterative method, we formulate sufficient conditions which guarantee the existence of extremal or quasi-solutions in the corresponding region bounded by upper and lower solutions of our problems. The case when a unique solution exists is also investigated. Some examples are given to illustrate...
-
The paired-domination and the upper paired-domination numbers of graphs
PublikacjaIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
No Quantum Realization of Extremal No-Signaling Boxes
PublikacjaThe study of quantum correlations is important for fundamental reasons as well as for quantum communication and information processing tasks. On the one hand, it is of tremendous interest to derive the correlations produced by measurements on separated composite quantum systems from within the set of all correlations obeying the no-signaling principle of relativity, by means of information-theoretic principles. On the other hand,...
-
Subadditivity of the minimum output entropy and superactivation of the classical capacity of quantum multiple access channels
PublikacjaWe study subadditivity of the minimum output entropy (Hmin) of quantum multiple access channels (MACs). We provide an example of violation of the additivity theorem for Hmin known in classical information theory. Our result is based on a fundamental property of MACs, i.e., independence of each sender. The channels used in the example can be constructed explicitly. On the basis of subadditivity of Hmin we also provide an example...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Extending loophole-free nonlocal correlations to arbitrarily large distances
PublikacjaQuantum theory allows spatially separated observers to share nonlocal correlations, which enable them to accomplish classically inconceivable information processing and cryptographic feats. However, the distances over which nonlocal correlations can be realized remain severely limited due to their high fragility to noise and high threshold detection efficiencies. To enable loophole- free nonlocality across large distances, we introduce...
-
Quantum entanglement
PublikacjaAll our former experience with application of quantum theory seems to say that what is predicted by quantum formalism must occur in the laboratory. But the essence of quantum formalism-entanglement, recognized by Einstein, Podolsky, Rosen, and Schrödinger-waited over 70 years to enter laboratories as a new resource as real as energy. This holistic property of compound quantum systems, which involves nonclassical correlations between...
-
Bounds on the Cover Time of Parallel Rotor Walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
Amplifying the Randomness of Weak Sources Correlated With Devices
PublikacjaThe problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this paper, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition...
-
On extremal sizes of locally k-tree graphs
PublikacjaA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...