English
Related papers

Related papers: MacWilliams-type equivalence relations

200 papers

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz

In [1] we introduced the notion of 'structured space', i.e. a space which locally resembles various algebraic structures. In [2] and [3] we studied some cohomology theories related to these space. In this paper we continue in this…

Algebraic Topology · Mathematics 2020-05-15 Manuel Norman

We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities…

Logic · Mathematics 2017-09-26 Miloš S. Kurilić

In categories of linear relations between finite dimensional vector spaces, composition is well-behaved only at pairs of relations satisfying transversality and monicity conditions. A construction of Wehrheim and Woodward makes it possible…

Symplectic Geometry · Mathematics 2015-03-24 Alan Weinstein

We examine double successive approximations on a set, which we denote by $L_2L_1, \ U_2U_1, U_2L_1,$ $L_2U_1$ where $L_1, U_1$ and $L_2, U_2$ are based on generally non-equivalent equivalence relations $E_1$ and $E_2$ respectively, on a…

Logic in Computer Science · Computer Science 2016-12-13 Alexa Gopaulsingh

For any countable graph $E$, we investigate the relationship between the Leavitt path algebra $L_{\C}(E)$ and the graph C*-algebra $C^*(E)$. For graphs $E$ and $F$, we examine ring homomorphisms, ring *-homomorphisms, algebra homomorphisms,…

Operator Algebras · Mathematics 2009-12-08 Gene Abrams , Mark Tomforde

We show that every poset P=(P,\le) satisfying the Ascending Chain Condition can be isomorphically embedded into the poset of all mappings from P to the set A(P) of all antichains of P equipped with a certain partial order relation. This…

General Mathematics · Mathematics 2026-02-03 Ivan Chajda , Helmut Länger

Certain weight-based orders on the free associative algebra $R = k<x_1, ..., x_t >$ can be specified by $t \times \infty$ arrays whose entries come from the subring of nonnegative elements in a totally ordered field. Such an array $A$…

Rings and Algebras · Mathematics 2016-11-17 J. W. Johnson

Let $\mathcal{E}(X)$ be the group of homotopy classes of self homotopy equivalences for a connected CW complex $X$. We observe two classes of maps $\mathcal{E}$-maps and co-$\mathcal{E}$-maps. They are defined as the maps $X\to Y$ that…

Algebraic Topology · Mathematics 2016-08-16 Jin-ho Lee , Toshihiro Yamaguchi

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Combinatorics · Mathematics 2007-06-12 Geir Agnarsson

Linear categories naturally have several identification relations : isomorphisms, categorical equivalences and Morita equivalences. In this thesis, we construct the classifying stacks for these three relations ($\ukcatiso$, $\ukcateq$,…

Algebraic Geometry · Mathematics 2007-05-23 Mathieu Anel

Given finite posets $P$ and $Q$, we consider a specific ideal $L(P,Q)$, whose minimal monomial generators correspond to order-preserving maps $\phi:P\rightarrow Q$. We study algebraic invariants of those ideals. In particular, sharp lower…

Commutative Algebra · Mathematics 2016-04-26 Martina Juhnke-Kubitzke , Lukas Katthän , Sara Saeedi Madani

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

Combinatorics · Mathematics 2019-08-20 Frank a Campo

Let $X$ be a Polish space, $d$ a pseudo-metric on $X$. If $\{(u,v):d(u,v)<\delta\}$ is ${\bf\Pi}^1_1$ for each $\delta>0$, we show that either $(X,d)$ is separable or there are $\delta>0$ and a perfect set $C\subseteq X$ such that…

Logic · Mathematics 2010-06-24 Longyun Ding

Learning representations for semantic relations is important for various tasks such as analogy detection, relational search, and relation classification. Although there have been several proposals for learning representations for individual…

Computation and Language · Computer Science 2015-05-04 Danushka Bollegala , Takanori Maehara , Ken-ichi Kawarabayashi

It is a classical result that the multilinear component of the free Lie algebra is isomorphic (as a representation of the symmetric group) to the top (co)homology of the proper part of the poset of partitions $\Pi_n$ tensored with the sign…

Combinatorics · Mathematics 2017-11-21 Rafael S. González D'León

We give a correspondence between automorphic pairs of distributions on $\mathbb{R}$ and Dirichlet series satisfying functional equations and some additional analytic conditions. Moreover, we show that the notion of automorphic pairs of…

Number Theory · Mathematics 2020-02-27 Tadashi Miyazaki

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

Logic · Mathematics 2021-01-01 Dakota Thor Ihli

Shearer and McEliece [1977] showed that there is no MacWilliams identity for the free distance spectra of orthogonal linear convolutional codes. We show that on the other hand there does exist a MacWilliams identity between the generating…

Information Theory · Computer Science 2010-04-23 G. David Forney