Results 61 to 70 of about 335 (183)
SELECTION OF SOLUTIONS FOR DESIGNING OPEN SYSTEMS BASED ON ANALYSIS OF VARIANTS WITH RANDOM WEIGHTS
A new one-parameter approach to the selection of optimal solutions for the design of complex systems is proposed. The approach is based on the analysis of a tree of variants with random weights (here weight is a certain non-negative quantity: for example,
A. A. Pastushkov, V. K. Batovrin
doaj +1 more source
On triangular matroids induced by n3-configurations
A triangular matroid is a rank-3 matroid whose ground set consists of the points of an n3{n}_{3}-configuration and whose bases are the point triples corresponding to non-triangles within the configuration.
Alazemi Abdullah, Raney Michael
doaj +1 more source
Osculating geometry and higher‐order distance Loci
Abstract We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first‐order tangency. We focus on the data locus of points possessing at least one critical point of the distance function ...
Sandra Di Rocco +2 more
wiley +1 more source
Modular elimination in matroids and oriented matroids
We introduce a new axiomatization of matroid theory that requires the elimination property only among modular pairs of circuits, and we present a cryptomorphic phrasing thereof in terms of Crapo's axioms for flats. This new point of view leads to a corresponding strengthening of the circuit axioms for oriented matroids.
openaire +2 more sources
On the k-volume rigidity of a simplicial complex in ℝ d
We define a generic rigidity matroid for k-volumes of a simplicial complex in $\mathbb {R}^d$ and prove that for $2\leq k \leq d-1$ it has the same rank as the classical generic d-rigidity matroid on the same vertex set (namely, the case
Alan Lew +3 more
doaj +1 more source
A tropical approach to rigidity: Counting realisations of frameworks
Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
Power graphs and exchange property for resolving sets
Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given.
Abbas Ghulam +4 more
doaj +1 more source
Detection of Emergent Situations in Complex Systems by Structural Invariant (MB, M)
The paper introduces complete description of the detection method that uses structural invariant Matroid and its Bases (MB, M). There are recapitulated essential concepts from the used knowledge field as “complex system, emergent situations (A, B, C ...
Jiri Bila, Martin Novak
doaj +1 more source
Simulating quantum computations with Tutte polynomials
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids.
Ryan L. Mann
doaj +1 more source
Toric amplitudes and universal adjoints
Abstract A toric amplitude is a rational function associated with a simplicial polyhedral fan. The definition is inspired by scattering amplitudes in particle physics. We prove algebraic properties of such amplitudes and study the geometry of their zero loci. These hypersurfaces play the role of Warren's adjoint via a dual volume interpretation.
Simon Telen
wiley +1 more source

