English
Related papers

Related papers: On the notion of composite system

200 papers

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

Computational Complexity · Computer Science 2024-11-27 Nimrod Megiddo

A general description of entanglement is suggested as an action realized by an arbitrary operator over given disentangled states. The related entanglement measure is defined. Because of its generality, this definition can be employed for…

Quantum Physics · Physics 2009-11-10 V. I. Yukalov

This article focuses on the optimization of a complex system which is composed of several subsystems. On the one hand, these subsystems are subject to multiple objectives, local constraints as well as local variables, and they are…

We define a partition of a reductive group into finitely many subsets, refining the partition of the group into strata. We state some conjectural properties of these subsets (called substrata) and verify them in some examples.

Representation Theory · Mathematics 2026-03-26 G. Lusztig

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

Probability · Mathematics 2013-08-16 Richard Arratia , Simon Tavare

The paper is devoted to further development of the new approach in equilibrium statistical mechanics the basis of which was worked out in a series of articles by the author. The approach proceeds on the use of a hierarchy of equations for…

Quantum Physics · Physics 2008-10-17 V. A. Golovko

We consider the basic features of complex dynamic and control systems, including systems having hierarchical structure. Special attention is paid to the problems of design and synthesis of complex systems and control models, and to the…

Computational Engineering, Finance, and Science · Computer Science 2008-12-25 Armen Bagdasaryan

The aim of the paper is to present the integrable systems on partial isometries which are related to the restricted Grassmannian in finite dimensional context. Some explicit solutions are obtained.

Exactly Solvable and Integrable Systems · Physics 2025-04-07 Tomasz Goliński , Alice Barbora Tumpach

Extremal elements and a h-hull of sets in the n-dimensional hypercomplex space are investigated. Introduced a class of H-quasiconvex sets including strongly hypercomplex convex sets and being closed with respect to intersections.

Metric Geometry · Mathematics 2015-10-05 M. V. Stefanchuk

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

Combinatorics · Mathematics 2010-08-03 R. Nandakumar

This document is both a synthesis of current notions about complex systems, and a practical approach description. A disambiguation is proposed and exposes possible reasons for controversies related to causation and emergence. Theoretical…

Adaptation and Self-Organizing Systems · Physics 2008-03-05 Nicolas Brodu

We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such…

Quantum Physics · Physics 2009-11-10 Howard Barnum , Emanuel Knill , Gerardo Ortiz , Rolando Somma , Lorenza Viola

A geometrical characterization of robustly separable (that is, remaining separable under sufficiently small variiations) mixed states of a bipartite quantum system is given. It is shown that the density matrix of any such state can be…

Quantum Physics · Physics 2007-05-23 Roman R. Zapatrin

Simultaneous decompositions of a pair of states into pure ones are examined. There are privileged decompositions which are distinguished from all the other ones.

Quantum Physics · Physics 2009-11-06 Armin Uhlmann

Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…

Data Structures and Algorithms · Computer Science 2009-06-03 Yuanlin Zhang , Forrest Sheng Bao

This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $\Omega(|A|^{3/2})$ three-term arithmetic progressions.

Combinatorics · Mathematics 2025-09-03 Thomas F. Bloom , Jakob Führer , Oliver Roche-Newton

Coherent structures emerge from the dynamics of many kinds of dissipative, externally driven, nonlinear systems, and continue to provoke new questions that challenge our physical and mathematical understanding. In one specific sub-class of…

Pattern Formation and Solitons · Physics 2010-08-24 Jonathan Dawes

I present my viewpoint on complexity, stressing general arguments and using a rather simple language.

Statistical Mechanics · Physics 2007-05-23 Giorgio Parisi

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

Combinatorics · Mathematics 2023-06-02 Ada Stelzer , Alexander Yong

We discuss the relation between the "compositeness" of an s-wave bound state, as derived from a related partial wave scattering amplitude, and the corresponding spatial probability densities, for the case of spherically symmetric,…

High Energy Physics - Phenomenology · Physics 2019-05-23 Peter C. Bruns
‹ Prev 1 4 5 6 7 8 10 Next ›