English
Related papers

Related papers: Calculation Rules and Cancellation Rules for Stron…

200 papers

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 ${\cal H}(P,C_3)$ be the set of order homomorphisms from a poset $P$ to the chain $C_3 = 1 < 2 < 3$. We develop a recursive approach for the calculation of the cardinality of ${\cal H}(P,C_3)$, and we apply it on several types of…

Combinatorics · Mathematics 2021-07-06 Frank a Campo

We study dismantlability in graphs. In order to compare this notion to similar operations in posets (partially ordered sets) or in simplicial complexes, we prove that a graph G dismants on a subgraph H if and only if H is a strong…

Combinatorics · Mathematics 2010-10-12 Etienne Fieux , Jacqueline Lacaze

Let R be a commutative ring, M an R-module, and N a finitely presented R-module such that the intersection of Max(R) and Supp(N) is finite-dimensional and Noetherian. Suppose also that N is homothetic; in other words, suppose that the…

Commutative Algebra · Mathematics 2021-08-10 Robin Baidya

We fully characterize regular Hom-Lie structures on the incidence algebra $I(X,K)$ of a finite connected poset $X$ over a field $K$. We prove that such a structure is the sum of a central-valued linear map annihilating the Jacobson radical…

Rings and Algebras · Mathematics 2022-12-27 Érica Z. Fornaroli , Mykola Khrypchenko , Ednei A. Santulo

Structural properties of finite digraphs $R$ and $S$ are studied which enforce $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of homomorphisms from $G$ to $H$, and…

Combinatorics · Mathematics 2020-11-03 Frank a Campo

Homomorphisms between relational structures are not only fundamental mathematical objects, but are also of great importance in an applied computational context. Indeed, constraint satisfaction problems (CSPs), a wide class of algorithmic…

Computational Complexity · Computer Science 2011-05-23 Martin Grohe , Marc Thurley

We continue the study of exponent-cancellation for finite ordered sets. It is known that $A$ can be reconstructed from $A^{A}$, from $(A^{A})^{A}$, and from $A^{A^{A}}$. In this note we prove the next result in this hierarchy: the ordered…

Rings and Algebras · Mathematics 2025-10-02 G. Grätzer

Let $\mathcal O$ be a holomorphy ring in a global field $K$, and $R$ a classical maximal $\mathcal O$-order in a central simple algebra over $K$. We study sets of lengths of factorizations of cancellative elements of $R$ into atoms…

Rings and Algebras · Mathematics 2013-08-15 Daniel Smertnig

For two semi-simple algebras $A$ and $B$ over an arbitrary ground field $F$, we give a numerical criterion when $\Hom_F(A,B)$, the set of $F$-algebra homomorphisms between them, is non-empty. We also determine when the orbit set $B^\times…

Rings and Algebras · Mathematics 2012-04-24 Chia-Fu Yu

Extending the work of Bell, Matsuzawa and Satriano, we consider a finite set of polynomials $S$ over a number field $K$ and give a necessary and sufficient condition for the existence of a $N \in \mathbb{N}_{> 0}$ and a finite set $Z…

Number Theory · Mathematics 2023-02-03 Xiao Zhong

Let $\xx= x_1,\ldots,x_r$ denote a system of elements of a commutative ring $R$. For an $R$-module $M$ we investigate when $\xx$ is $M$-pro-regular resp. $M$-weakly pro-regular as generalizations of $M$-regular sequences. This is done in…

Commutative Algebra · Mathematics 2024-04-23 Peter Schenzel

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

Computational Complexity · Computer Science 2024-04-16 Ambroise Baril , Miguel Couceiro , Victor Lagerkvist

We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…

Computational Complexity · Computer Science 2022-08-19 J. A. Gregor Lagodzinski , Andreas Göbel , Katrin Casel , Tobias Friedrich

Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a…

Computational Complexity · Computer Science 2016-12-28 Benjamin Rossman

Given two algebraic groups $G$, $H$ over a field $k$, we investigate the representability of the functor of morphisms (of schemes) $\mathbf{Hom}(G,H)$ and the subfunctor of homomorphisms (of algebraic groups) $\mathbf{Hom}_{\rm gp}(G,H)$.…

Algebraic Geometry · Mathematics 2021-08-06 Michel Brion

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

Logic · Mathematics 2017-11-21 Miloš S. Kurilić , Nenad Morača

It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…

Symbolic Computation · Computer Science 2018-02-06 Moulay A. Barkatou , Maximilian Jaroschek

The A-model for finite rank singular perturbations of class $\mathfrak{H}_{-m-2}\smallsetminus\mathfrak{H}_{-m-1}$, $m\in\mathbb{N}$, is considered from the perspective of boundary relations. Assuming further that the Hilbert spaces…

Functional Analysis · Mathematics 2020-08-03 Rytis Jursenas

Let I be a homogeneous ideal in a polynomial ring P over a field. By Macaulay's Theorem, there exists a lexicographic ideal L=Lex(I) with the same Hilbert function as I. Peeva has proved that the Betti numbers of P/I can be obtained from…

Commutative Algebra · Mathematics 2009-04-08 Maria Evelina Rossi , Leila Sharifan
‹ Prev 1 2 3 10 Next ›