English
Related papers

Related papers: Calculation Rules and Cancellation Rules for Stron…

200 papers

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

Logic · Mathematics 2024-06-07 Miloš S. Kurilić

For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…

Combinatorics · Mathematics 2012-06-15 David Galvin , Prasad Tetali

For minimizers in a geometrically nonlinear Cosserat model for micropolar elasticity of continua, we prove interior H\"older regularity, up to isolated singular points that may be possible if the exponent $p$ from the model is $2$ or in…

Analysis of PDEs · Mathematics 2017-05-01 Andreas Gastel

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

Logic · Mathematics 2023-10-17 Miloš S. Kurilić , Stevo Todorčević

In this work we present necessary cancellation conditions for the continuity of linear operators in $h^p(\mathbb{R}^n)$, $0<p\leq 1$, that map atoms into pseudo-molecules. Our necessary condition, expressed in terms of the $T^{\ast}$…

Analysis of PDEs · Mathematics 2022-10-13 Galia Dafni , Chun Ho Lau , Tiago Picon , Claudio Vasconcelos

Given a simplicial pair $(X,A)$, a simplicial complex $Y$, and a map $f:A \to Y$, does $f$ have an extension to $X$? We show that for a fixed $Y$, this question is algorithmically decidable for all $X$, $A$, and $f$ if $Y$ has the rational…

Algebraic Topology · Mathematics 2024-10-22 Fedor Manin

Many important graph theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular, independent sets and colourings. In this article we study the complexity of…

Computational Complexity · Computer Science 2018-04-24 Andreas Göbel , J. A. Gregor Lagodzinski , Karen Seidel

In previous work, we related homotopy types of finite $(G,n)$-complexes when $G$ has periodic cohomology to projective $\mathbb{Z} G$-modules representing the Swan finiteness obstruction. We use this to determine when $X \vee S^n \simeq Y…

Algebraic Topology · Mathematics 2024-06-12 John Nicholson

In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to decide whether there exists a subset W of V(G) of size at…

Data Structures and Algorithms · Computer Science 2013-08-06 Rajesh Chitnis , Laszlo Egri , Daniel Marx

Equality of the second order arithmetic means of two principal ideals does not imply equality of their first order arithmetic means (second order equality cancellation). We provide fairly broad sufficient conditions on one of the principal…

Functional Analysis · Mathematics 2007-07-23 Victor Kaftal , Gary Weiss

We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples…

Probability · Mathematics 2007-05-23 James Allen Fill , Motoya Machida

We present algorithms to compute the vector space of homomorphisms Hom(X,Y) between finitely generated representations of the partially ordered set Z^d. Our results generalise to any partially ordered set. Our main theoretical contribution…

Algebraic Topology · Mathematics 2026-04-14 Jan Jendrysiak

In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite…

Logic · Mathematics 2015-10-20 Lucy Ham

A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…

Computational Complexity · Computer Science 2019-06-28 Jacob Focke , Leslie Ann Goldberg , Stanislav Zivny

Let $R\subset F$ be an extension of real closed fields and ${\mathcal S}(M,R)$ the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$. We prove that every $R$-homomorphism $\varphi:{\mathcal S}(M,R)\to F$ is…

Algebraic Geometry · Mathematics 2015-09-16 Jose F. Fernando

Let A be a ring of dimension d and let P be a projective A-module of rank d. We prove that if for every finite extension R of A, R^d is cancellative, then P is cancellative. This gives an alternate proof of Bhatwadekar's result: every…

Commutative Algebra · Mathematics 2010-10-29 Manoj Kumar Keshari

The notions of Betti numbers and of Bass numbers of a finite module N over a local ring R are extended to modules that are only assumed to be finite over S, for some local homomorphism f: R --> S. Various techniques are developed to study…

Commutative Algebra · Mathematics 2007-05-23 Luchezar L. Avramov , Srikanth Iyengar , Claudia Miller

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…

Logic · Mathematics 2019-01-08 Kevin M. Berg