English
Related papers

Related papers: MS-measurability via Coordinatization

200 papers

We describe those complete linearly ordered topological spaces $X$ which are homogeneous (=CHLOTS). That is, $X$ is order isomorphic with any nonempty open interval in $X$. Using countable tail-like ordinals as indices, we build towers of…

General Topology · Mathematics 2021-09-22 Ethan Akin , Karel Hrbacek

We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…

Logic in Computer Science · Computer Science 2024-02-14 Elena Di Lavore , Paweł Sobociński

Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. This is applied by Du (2010) [A note on cone…

General Topology · Mathematics 2011-09-23 Huseyin Cakalli , Ayse Sonmez , Cigdem Genc

In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…

Combinatorics · Mathematics 2017-09-15 Miklos Bona

Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…

Category Theory · Mathematics 2015-10-21 Victoria Gould , Tim Stokes

This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…

Statistical Mechanics · Physics 2015-03-26 Roberto C. Alamino

Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…

Combinatorics · Mathematics 2022-01-06 Juan M. Alonso

Attack trees (ATs) are popular graphical models for reasoning about the security of complex systems, allowing for the quantification of risk through so-called AT metrics. A large variety of different such AT metrics have been proposed, and…

Cryptography and Security · Computer Science 2025-11-19 Benedikt Peterseim , Milan Lopuhaä-Zwakenberg

Measure Equivalence (ME) is the measure theoretic counterpart of quasi-isometry. This field grew considerably during the last years, developing tools to distinguish between different ME classes of countable groups. On the other hand,…

Dynamical Systems · Mathematics 2007-05-23 Damien Gaboriau

Measure and integral are two closely related, but distinct objects of study. Nonetheless, they are both real-valued lattice valuations: order preserving real-valued functions $\phi$ on a lattice $L$ which are modular, i.e.,…

Functional Analysis · Mathematics 2019-03-15 Abraham A. Westerbaan

Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…

General Topology · Mathematics 2015-11-06 Ittay Weiss

We show that any metacompact Moore space is monotonically metacompact and use that result to characterize monotone metacompactness in certain generalized ordered (GO)spaces. We show, for example, that a generalized ordered space with a…

General Topology · Mathematics 2011-08-29 Harold R. Bennett , Klaas Pieter Hart , David J. Lutzer

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

Metric approximate categories, or metagories, for short, are metrically enriched graphs. Their structure assigns to every directed triangle in the graph a value which may be interpreted as the area of the triangle; alternatively, as the…

Category Theory · Mathematics 2019-04-02 Walter Tholen , Jiyu Wang

This paper studies visual search using structured queries. The structure is in the form of a 2D composition that encodes the position and the category of the objects. The transformation of the position and the category of the objects leads…

Computer Vision and Pattern Recognition · Computer Science 2020-10-28 Mert Kilickaya , Arnold W. M. Smeulders

Majorization is a partial order on real vectors which plays an important role in a variety of subjects, ranging from algebra and combinatorics to probability and statistics. In this paper, we consider a generalized notion of majorization…

Representation Theory · Mathematics 2020-12-18 Colin McSwiggen , Jonathan Novak

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Logic in Computer Science · Computer Science 2019-03-14 Pierre-Louis Curien , Samuel Mimram

A characterization of the symmetry algebra of the $n$th order ordinary differential equations (ODEs) with maximal symmetry and all third order linearizable ODEs is given. This is used to show that such an algebra $\mathfrak{g}$ determines…

Classical Analysis and ODEs · Mathematics 2020-06-25 Sajid Ali , Hassan Azad , Said Waqas Shah , Fazal M. Mahomed

We investigate the relation between degree sequences of trees and the majorization order using the Muirhead theorem. In this way, we prove a theorem that provides a necessary and sufficient condition for delta sequences of trees to be…

Combinatorics · Mathematics 2024-07-22 Leo Egghe , Ronald Rousseau

We consider the simultaneous movement of finitely many colored points in space, calling it a spatial sorting process. The name suggests a purpose that drives the collection to a configuration of increased or decreased order. Mapping such a…

Computational Geometry · Computer Science 2012-07-30 Herbert Edelsbrunner , Carl-Philipp Heisenberg , Michael Kerber , Gabriel Krens
‹ Prev 1 8 9 10 Next ›