English
Related papers

Related papers: The structure of rough sets defined by reflexive r…

200 papers

Modeling the full-range deformation behaviors of materials under complex loading and materials conditions is a significant challenge for constitutive relations (CRs) modeling. We propose a general encoder-decoder deep learning framework…

Materials Science · Physics 2023-04-04 Qing-Jie Li , Mahmut Nedim Cinbiz , Yin Zhang , Qi He , Geoffrey Beausoleil , Ju Li

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…

K-Theory and Homology · Mathematics 2009-11-02 Tomasz Maszczyk

We study reflexivity and structure properties of operator algebras generated by representations of the discrete Heisenberg semi-group. We show that the left regular representation of this semi-group gives rise to a semi-simple reflexive…

Operator Algebras · Mathematics 2014-07-15 M. Anoussis , A. Katavolos , I. G. Todorov

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

We present resent results regarding invertible, non-degenerate solutions of the set-theoretic Yang-Baxter and reflection equations. We recall the notion of braces and we present and prove various fundamental properties required for the…

Quantum Algebra · Mathematics 2025-05-21 Anastasia Doikou

A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…

Information Theory · Computer Science 2021-07-07 Markus Püschel , Bastian Seifert , Chris Wendler

In the present paper, we study relative difference sets (RDSs) and linked systems of them. It is shown that a closed linked system of RDSs is always graded by a group. Based on this result, we also define a product of RDS linked systems…

Combinatorics · Mathematics 2023-12-14 Mikhail Muzychuk , Grigory Ryabov

A $\mathbb{D}$-semi-classical weight is one which satisfies a particular linear, first order homogeneous equation in a divided-difference operator $\mathbb{D}$. It is known that the system of polynomials, orthogonal with respect to this…

Classical Analysis and ODEs · Mathematics 2012-04-12 N. S. Witte

We construct a logarithmic model of connections on smooth quasi-projective $n$-dimensional geometrically irreducible varieties defined over an algebraically closed field of characteristic $0$. It consists of a good compactification of the…

Algebraic Geometry · Mathematics 2019-05-03 Hélène Esnault , Claude Sabbah

The general framework for integrable discrete systems on R in particular containing lattice soliton systems and their q-deformed analogues is presented. The concept of regular grain structures on R, generated by discrete one-parameter…

Exactly Solvable and Integrable Systems · Physics 2016-02-18 Maciej Blaszak , Metin Gurses , Burcu Silindir , Blazej M. Szablikowski

We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…

Formal Languages and Automata Theory · Computer Science 2015-10-13 Igor Potapov , Olena Prianychnykova , Sergey Verlan

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…

We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite…

Functional Analysis · Mathematics 2021-12-06 S. Papapanayides , I. G. Todorov

We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…

Functional Analysis · Mathematics 2014-05-30 Paul Poncet

We apply to locally finite partially ordered sets a construction which associates a complete lattice to a given poset; the elements of the lattice are the closed subsets of a closure operator, defined starting from the concurrency relation.…

Logic in Computer Science · Computer Science 2009-11-13 Luca Bernardinello , Lucia Pomello , Stefania Rombolà

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

Within a framework of noncommutative geometry, we develop an analogue of (pseudo) Riemannian geometry on finite and discrete sets. On a finite set, there is a counterpart of the continuum metric tensor with a simple geometric…

General Relativity and Quantum Cosmology · Physics 2009-10-31 A. Dimakis , F. Muller-Hoissen

Let R be a von Neumann algebra acting on a Hilbert space H and let R_sa be the set of selfadjoint elements of R. It is well known that R_sa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define…

Mathematical Physics · Physics 2007-05-23 Hans F. de Groote

Almost any reasonable class of finite relational structures has the Ramsey property or a precompact Ramsey expansion. In contrast to that, the list of classes of finite algebras with the precompact Ramsey expansion is surprisingly short. In…

Combinatorics · Mathematics 2023-03-13 Dragan Masulovic
‹ Prev 1 3 4 5 6 7 10 Next ›