English
Related papers

Related papers: Maximally Embeddable Components

200 papers

We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…

Combinatorics · Mathematics 2025-06-11 Mikhail Gorsky , Nicholas J. Williams

We study the conformal capacity ${\rm cap}(\Omega,K)$ where $\Omega$ is a bounded domain of $\mathbb{R}^2$ and $K$ is a compact connected set in $\Omega$. Because the exact numerical value of the capacity is known only in a handful of…

Numerical Analysis · Mathematics 2025-12-16 Harri Hakula , Oona Rainio , Matti Vuorinen

In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…

Logic · Mathematics 2023-06-30 Asier Estevan Muguerza

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Commutative Algebra · Mathematics 2020-10-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

We investigate $\mathcal F$-Borel topological spaces. We focus on finding out how a~complexity of a~space depends on where the~space is embedded. Of a~particular interest is the~problem of determining whether a~complexity of given space $X$…

General Topology · Mathematics 2020-02-24 Vojtěch Kovařík

We study the quasi-order of topological embeddability on definable functions between Polish zero-dimensional spaces. We first study the descriptive complexity of this quasi-order restricted to the space of continuous functions. Our main…

Logic · Mathematics 2024-10-18 Raphaël Carroy , Yann Pequignot , Zoltán Vidnyánszky

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

Rings and Algebras · Mathematics 2016-03-16 Robert Egrot

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

We prove that partially ordered set has finite number of finite-dimensional indecomposable nonequivalent Hilbert representations with orthoscalarity condition if and anly if it has finite number of indecomposable linear representations. We…

Representation Theory · Mathematics 2010-06-17 Roman Grushevoi , Kostyantyn Yusenko

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

Combinatorics · Mathematics 2023-07-28 Nadav Meir , Aris Papadopoulos

We study varieties with a term-definable poset structure, "po-groupoids". It is known that connected posets have the "strict refinement property" (SRP). In [arXiv:0808.1860v1 [math.LO]] it is proved that semidegenerate varieties with the…

Logic · Mathematics 2009-11-04 Pedro Sánchez Terraf

Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…

Functional Analysis · Mathematics 2022-01-03 Masoumeh Ebrahimzadeh , Kazem Haghnejad Azar

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

Combinatorics · Mathematics 2024-02-12 V. Ironmonger , N. Ruskuc

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

Given a measurable space (X, M) there is a (Galois) connection between sub-sigma-algebras of M and equivalence relations on X. On the other hand equivalence relations on X are closely related to congruences on stochastic relations. In…

Logic in Computer Science · Computer Science 2010-06-03 Ingo Battenfeld

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

We study metric spaces defined via a conformal weight, or more generally a measurable Finsler structure, on a domain $\Omega \subset \mathbb{R}^2$ that vanishes on a compact set $E \subset \Omega$ and satisfies mild assumptions. Our main…

Metric Geometry · Mathematics 2020-06-08 Toni Ikonen , Matthew Romney

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…

General Topology · Mathematics 2015-02-17 M. R. Koushesh

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker
‹ Prev 1 4 5 6 7 8 10 Next ›