Related papers: Modularity, Extensions and Connectivity in Infinit…

A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is…

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a…

Let $T$ be a subset of a ring $A$, and let $M$ be an $A$-module. We study the additive subgroups $F$ of $M$ such that, for all $x \in M$, if $tx \in F$ for some $t \in T$, then $x \in F$. We call any such subset $F$ of $M$ a $T$-factroid of…

We study the possibility of a continuous extension of a class of mappings to an isolated point on the boundary of a domain. We show that if some characteristic of this mapping is integrable on almost all spheres in the neighborhood of at…

We prove that for a general $N$-component model on a $d$-dimensional lattice $\bZ^d$ with pairwise nearest-neighbor coupling and general local interaction obeying a stability bound the linked cluster expansion has a finite radius of…

We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…

We study $\infty$-modulus on general metric spaces and establish its relation to shortest lengths of paths. This connection was already known for modulus on graphs, but the formulation in metric measure spaces requires more attention to…

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

In this work we introduce a new concept, namely, $\tau_{s}$-extending modules (rings) which is torsion-theoretic analogues of extending modules and then we extend many results from extending modules to this new concept. For instance we show…

We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…

Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

In this paper, we consider finitely generated modules over commutative Noetherian rings whose tensor products have finite projective dimension. We construct examples of modules of infinite projective dimension (and also of infinite…

A matroid is a notion of independence in combinatorial optimization which is closely related to computational efficiency. In particular, it is well known that the maximum of a constrained modular function can be found greedily if and only…

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…

We show that a large class of satellite operators are rank-expanding; that is, they map some rank-one subgroup of the concordance group onto an infinite linearly independent set. Our work constitutes the first systematic study of this…

Using the sine-Gordon model as the prime example an alternative approach to integrable boundary conditions for a theory restricted to a half-line is proposed. The main idea is to explore the consequences of taking into account the…

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…