Measure theory aspects of locally countable orderings

2006 ◽  
Vol 71 (3) ◽  
pp. 958-968 ◽  
Author(s):  
Liang Yu
Keyword(s):  
Partial Order ◽  
Measure Theory ◽  
Locally Countable

AbstractWe prove that for any locally countable partial order ℙ = (2ε, ≤p, there exists a nonmeasurable antichain in ℙ. Some applications of the result are also presented.

Matrix Completions, Moments, and Sums of Hermitian Squares

2011 ◽  
Author(s):  
Mihály Bakonyi ◽  
Hugo J. Woerdeman
Keyword(s):  
Linear Algebra ◽  
Undergraduate Students ◽  
Complex Analysis ◽  
Measure Theory ◽  
Complex Function ◽  
Complex Function Theory ◽  
Extensive Discussion ◽  
The Subject ◽  
Processing Control ◽  
Developing Area

Intensive research in matrix completions, moments, and sums of Hermitian squares has yielded a multitude of results in recent decades. This book provides a comprehensive account of this quickly developing area of mathematics and applications and gives complete proofs of many recently solved problems. With MATLAB codes and more than two hundred exercises, the book is ideal for a special topics course for graduate or advanced undergraduate students in mathematics or engineering, and will also be a valuable resource for researchers. Often driven by questions from signal processing, control theory, and quantum information, the subject of this book has inspired mathematicians from many subdisciplines, including linear algebra, operator theory, measure theory, and complex function theory. In turn, the applications are being pursued by researchers in areas such as electrical engineering, computer science, and physics. The book is self-contained, has many examples, and for the most part requires only a basic background in undergraduate mathematics, primarily linear algebra and some complex analysis. The book also includes an extensive discussion of the literature, with close to six hundred references from books and journals from a wide variety of disciplines.

Deriving the Partial Order of Documents to Extend Clustering Applications

2019 ◽  
Vol 7 (1) ◽  
pp. 424-430
Author(s):  
A. George Louis Raja ◽  
F. Sagayaraj Francis ◽  
P. Sugumar
Keyword(s):  
Partial Order

Measure Theory and Fair Arbiters.

1987 ◽  
Author(s):  
David M. McKeown ◽  
Jr
Keyword(s):  
Measure Theory

The Transition Matrix Between the Specht and 𝔰𝔩3 Web Bases is Unitriangular With Respect to Shadow Containment

2020 ◽  
Author(s):  
Heather M Russell ◽  
Julianna Tymoczko
Keyword(s):  
Symmetric Group ◽  
Partial Order ◽  
Transition Matrix ◽  
Group Representation ◽  
Jones Polynomial ◽  
Basis Matrix ◽  
Combinatorial Structures ◽  
Quantum Invariants ◽  
One Dimensional ◽  
Link Diagrams

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.

Dynamic partial order reduction for relaxed memory models

2015 ◽  
Vol 50 (6) ◽  
pp. 250-259 ◽  
Author(s):  
Naling Zhang ◽  
Markus Kusano ◽  
Chao Wang
Keyword(s):  
Partial Order ◽  
Order Reduction ◽  
Memory Models ◽  
Partial Order Reduction ◽  
Relaxed Memory

scholarly journals Finite representability of semigroups with demonic refinement

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Robin Hirsch ◽  
Jaš Šemrl
Keyword(s):  
Partial Order ◽  
Turing Machines ◽  
Binary Relations ◽  
Finite Representation ◽  
First Order ◽  
Finite Structures ◽  
Finite Base ◽  
Finite Set ◽  
Finite Representability ◽  
Representation Class

AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.

scholarly journals Pseudo almost automorphic solutions of class r in α-norm under the light of measure theory

2020 ◽  
Vol 7 (1) ◽  
pp. 81-101
Author(s):  
Issa Zabsonre ◽  
Djendode Mbainadji
Keyword(s):  
Phase Space ◽  
Spectral Decomposition ◽  
Measure Theory ◽  
New Approach ◽  
Almost Automorphic ◽  
Almost Automorphic Functions ◽  
Pseudo Almost Automorphic ◽  
Automorphic Functions

AbstractUsing the spectral decomposition of the phase space developed in Adimy and co-authors, we present a new approach to study weighted pseudo almost automorphic functions in the α-norm using the measure theory.

Sign in / Sign up

Export Citation Format

Share Document