English
Related papers

Related papers: MacWilliams-type equivalence relations

200 papers

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

In this paper we investigate the connection between the Mac Lane (co)homology and Wieferich primes in finite localizations of global number rings. Following the ideas of Polishchuk-Positselski \cite{PP}, we define the Mac Lane (co)homology…

Algebraic Geometry · Mathematics 2025-02-07 Alexander I. Efimov

Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of…

Combinatorics · Mathematics 2024-12-10 Tim Boykett

We propose a semantic foundation for logics for reasoning in settings that possess a distinction between equality of variables, a coarser equivalence of variables, and a notion of conditional independence between variables. We show that…

Logic in Computer Science · Computer Science 2026-05-18 Alex Simpson

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…

Data Structures and Algorithms · Computer Science 2025-08-28 Shaul Rosner , Tami Tamir

In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…

Combinatorics · Mathematics 2018-07-31 Dragan Mašulović

Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…

Combinatorics · Mathematics 2025-02-05 Jan Snellman

Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…

Data Structures and Algorithms · Computer Science 2021-02-10 Daniel Selsam , Jesse Michael Han

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

Combinatorics · Mathematics 2024-08-30 Mathilde Bouvel , Luca Ferrari , Bridget Eileen Tenner

For a monomial ideal $I$, we consider the $i$th homological shift ideal of $I$, denoted by $\text{HS}_i(I)$, that is, the ideal generated by the $i$th multigraded shifts of $I$. Some algebraic properties of this ideal are studied. It is…

Commutative Algebra · Mathematics 2020-03-10 Jürgen Herzog , Somayeh Moradi , Masoomeh Rahimbeigi , Guangjun Zhu

The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…

Logic · Mathematics 2017-09-27 Dimitris Tsementzis

The aim of this paper is to develop a $(q,m)$-polymatroidal approach to higher supports and higher rank-weight enumerators of rank-metric codes. In this framework, we establish analogs of several fundamental results known for matroids and…

Combinatorics · Mathematics 2026-05-25 Koji Imamura , Shinya Kawabuchi , Keisuke Shiromoto

We study multiple orthogonal polynomials of type I and type II which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the…

Classical Analysis and ODEs · Mathematics 2013-10-04 Jonathan Coussement , Walter Van Assche

Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…

Information Theory · Computer Science 2017-05-02 Tuvi Etzion , Marcelo Firer , Roberto Assis Machado

Let $W$ be a simply laced Weyl group of finite type and rank $n$. If $W$ has type $E_7$, $E_8$, or $D_n$ for $n$ even, then the root system of $W$ has subsystems of type $nA_1$. This gives rise to an irreducible Macdonald representation of…

Combinatorics · Mathematics 2025-07-09 R. M. Green , Tianyuan Xu

The $P$-partition generating function of a (naturally labeled) poset $P$ is a quasisymmetric function enumerating order-preserving maps from $P$ to $\mathbb{Z}^+$. Using the Hopf algebra of posets, we give necessary conditions for two…

Combinatorics · Mathematics 2019-09-17 Ricky Ini Liu , Michael Weselcouch

It is quite an interesting phenomenon in Topology that configuration spaces on a manifold M are intrinsically related to certain mapping spaces from M. In this paper we interpret and greatly expand on this relationship. Building (mainly) on…

Algebraic Topology · Mathematics 2007-05-23 Sadok Kallel

We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…

Symplectic Geometry · Mathematics 2019-06-13 Christian Herrmann , Jonathan Lorand , Alan Weinstein

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah
‹ Prev 1 8 9 10 Next ›