Cover Image

Free polynomial strong bimonoids

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Droste, Manfred, Fülöp, Zoltán
Format:	Preprint
Published:	2025
Subjects:	Rings and Algebras Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Gröbner Approach to Dual-Containing Cyclic Left Module $(θ,δ)$-Codes over Finite Commutative Frobenius Rings
by: Liu, Hedongliang, et al.
Published: (2023)

Semirings of formal sums and injective partial transformations
by: Gadouleau, Maximilien, et al.
Published: (2026)

Graph Homomorphisms and Universal Algebra
by: Bodirsky, Manuel
Published: (2026)

Permutation clones that preserve relations
by: Boykett, Tim
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
by: Kurapov, Sergey, et al.
Published: (2025)

Tensor decomposition beyond uniqueness, with an application to the minrank problem
by: Koiran, Pascal, et al.
Published: (2025)

Algebraic properties of Indigenous semirings
by: Behzadipour, Hussein, et al.
Published: (2024)

Redundancy analysis using lcm-filtrations: networks, system signature and sensitivity evaluation
by: Mohammadi, Fatemeh, et al.
Published: (2025)

Finite Simple Groups in the Primitive Positive Constructability Poset
by: Meyer, Sebastian, et al.
Published: (2024)

Quantum Gates from Wolfram Model Multiway Rewriting Systems
by: Dündar, Furkan Semih, et al.
Published: (2025)

Rises for Measuring Local Distributivity in Lattices
by: Abdulla, Mohammad, et al.
Published: (2025)

Clonoids over vector spaces
by: Fioravanti, Stefano, et al.
Published: (2026)

A Spectral Rank-Loss Criterion for Intrinsic Structural Order in Hierarchical Correlative Structures
by: Bédrouni, Smaïn
Published: (2026)

Independent domination polynomial of comaximal graphs of commutative rings
by: Rather, Bilal Ahmad
Published: (2026)

Non-separable matrix builders for signal processing, quantum information and MIMO applications
by: Hurley, Ted, et al.
Published: (2021)

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
by: Porreca, Antonio E., et al.
Published: (2026)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2022)

Some polynomial classes for the acyclic orientation with parity constraint problem
by: Gravier, Sylvain, et al.
Published: (2026)

A polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2026)

Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

A quasi-polynomial bound for the minimal excluded minors for a surface
by: Houdaigoui, Sarah, et al.
Published: (2025)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Inapproximability of the independent set polynomial in the complex plane
by: Bezakova, Ivona, et al.
Published: (2017)

Effective Action in Free Probability
by: Ebrahimi-Fard, Kurusch, et al.
Published: (2023)

Injectivity of polynomials over finite discrete dynamical systems
by: Porreca, Antonio E., et al.
Published: (2025)

Maximal Cliques in Scale-Free Random Graphs
by: Bläsius, Thomas, et al.
Published: (2023)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

A note on eigenvalues of zero divisor graphs associated with commutative rings
by: Rather, Bilal Ahmad
Published: (2024)

Solving "pseudo-injective" polynomial equations over finite dynamical systems
by: Porreca, Antonio E., et al.
Published: (2025)