Related papers: A characterization of covering equivalence

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

We show the equivalence between two notions of log moduli stacks which appear in literatures. In particular, we generalize M.Olsson's theorem of representation of log algebraic stacks and answer a question posted by him (\cite{Ol4} 3.5.3).…

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

In this work, we extend the concept of the Lipschitz saturation of an ideal to the context of modules in some different ways, and we prove they are generically equivalent.

For a set $\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\}$ with non-negative integers $\lambda,\mu<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(\lambda,\mu;q)$-\emph{covering…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Bob predicts a future observation based on a sample of size one. Alice can draw a sample of any size before issuing her prediction. How much better can she do than Bob? Perhaps surprisingly, under a large class of loss functions, which we…

Strong numerical evidence is presented suggesting that all two-qubit mixed states are equivalent to X states by a single entanglement-preserving unitary (EPU) transformation, so that the concurrence of such an X state equals that of the…

We are interested in characterising the commutative rings for which a $1$-tilting cotorsion pair $(\mathcal{A}, \mathcal{T})$ provides for covers, that is when the class $\mathcal{A}$ is a covering class. We use Hrbek's bijective…

In our earlier posting "Matrix Pencils and Entanglement Classification", arXiv:0911.1803, we gave a polynomial-time algorithm for deciding if two states in a space of dimension $2\otimes m\otimes n$ are SLOCC equivalent. In this note, we…

In this work we extend the concept of the Lipschitz saturation of an ideal defined in [5] to the context of modules in some different ways, and we prove they are generically equivalent.

We introduce a new type of equivalence between blocks of finite group algebras called a strong isotypy. A strong isotypy is equivalent to a $p$-permutation equivalence and restricts to an isotypy in the sense of Brou\'{e}. To prove these…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…

There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…

The logical technique of focusing can be applied to the $\lambda$-calculus; in a simple type system with atomic types and negative type formers (functions, products, the unit type), its normal forms coincide with $\beta\eta$-normal forms.…

In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…

We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…

We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…

We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…