English
Related papers

Related papers: Calculation Rules and Cancellation Rules for Stron…

200 papers

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

Geometric Topology · Mathematics 2018-10-03 Greg Kuperberg , Eric Samperton

We survey all known examples of finite posets whose order polynomials have product formulas, and we propose the heuristic that these are the same posets with good dynamical behavior. Here the dynamics in question are the actions of…

Combinatorics · Mathematics 2024-08-09 Sam Hopkins

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

Logic in Computer Science · Computer Science 2021-07-01 Manuel Bodirsky , Thomas Feller , Simon Knäuer , Sebastian Rudolph

Let $\V$ be a mixed characteristic complete discrete valuation ring with perfect residue field. Let $\X$ be a smooth formal scheme over $\V$. We prove than a $\D ^\dag_{\X,\Q} $-module which is overcoherent after any change of basis is an…

Algebraic Geometry · Mathematics 2015-01-30 Daniel Caro

Let $R=\mathbb{F}_p$ or a field of characteristic $0$. For each $R$-good topological space $Y$, we define a collection of higher cohomology operations which, together with the cohomology algebra $H^*(Y;R)$ suffice to determine $Y$ up to…

Algebraic Topology · Mathematics 2017-12-12 David Blanc , Debasis Sen

In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…

Combinatorics · Mathematics 2025-11-06 Ragnar Freij-Hollanti , Teemu Lundström

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…

Data Structures and Algorithms · Computer Science 2023-10-16 Jan Böker , Louis Härtel , Nina Runde , Tim Seppelt , Christoph Standke

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

Rings and Algebras · Mathematics 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…

Rings and Algebras · Mathematics 2020-03-09 Chenrui Yao , Yao Ma , Liangyun Chen

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

Let $I$ and $J$ be two ideals of a commutative Noetherian ring $R$ and $M$ be an $R$-module. For a non-negative integer $n$ it is shown that, if the sets $\Ass_R(\Ext^{n} _{R}(R/I,M))$ and $\Supp_R(\Ext^{i}_{R}(R/I,H^{j}_{I,J} (M)))$ are…

Commutative Algebra · Mathematics 2015-02-18 Kh. Ahmadi Amoli , Z. Habibi , M. Jahangiri

We investigate under what conditions holomorphic forms defined on the regular locus of a reduced complex space extend to holomorphic (or logarithmic) forms on a resolution of singularities. We give a simple necessary and sufficient…

Algebraic Geometry · Mathematics 2021-02-02 Stefan Kebekus , Christian Schnell

Primes in the two complete associative normed division algebras C and H have affinities with structures seen in the standard model of particle physics. On the integers in the two algebras, there are two equivalence relations: a strong one,…

General Physics · Physics 2016-08-26 Oliver Knill

We give a complete classification of the reductive symmetric pairs (G,H) for which the homogeneous space $(G \times H)/diag(H)$ is real spherical in the sense that a minimal parabolic subgroup has an open orbit. Combining with a criterion…

Representation Theory · Mathematics 2014-05-12 Toshiyuki Kobayashi , Toshihiko Matsuki

For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…

Rings and Algebras · Mathematics 2013-05-10 George M. Bergman

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

Let $P,$ $S,$ and $T$ be semigroups, $f:P\to S$ and $g:P\to T$ semigroup homomorphisms, and $X$ a generating set for $S$ (possibly infinite). Clearly, a <i>necessary</i> condition for there to exist a homomorphism $S\to T$ making a…

Group Theory · Mathematics 2026-03-24 George M. Bergman

Let ${\mathcal A}$ be a nonempty real central arrangement of hyperplanes and ${\rm \bf Ch}$ be the set of chambers of ${\mathcal A}$. Each hyperplane $H$ defines a half-space $H^{+} $ and the other half-space $H^{-}$. Let $B = \{+, -\}$.…

Combinatorics · Mathematics 2007-07-05 Hiroaki Terao

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere. One of the most well studied problems in this area is…

Computational Complexity · Computer Science 2019-05-28 Amirhossein Kazeminia , Andrei A. Bulatov