Cover Image

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Porreca, Antonio E., Rolland, Marius
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Roots in the semiring of finite deterministic dynamical systems
by: Doré, François, et al.
Published: (2024)

Majority Boolean networks classifying density: structural characterization and complexity
by: Perrot, Kévin, et al.
Published: (2026)

Decomposition and factorisation of transients in Functional Graphs
by: Doré, François, et al.
Published: (2022)

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

A polynomial kernel for vertex deletion into bipartite permutation graphs
by: Derbisz, Jan
Published: (2021)

Matchings in permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
by: Bok, Jan, et al.
Published: (2020)

Frankl's diversity theorem for permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

Polynomial-delay generation of functional digraphs up to isomorphism
by: Defrain, Oscar, et al.
Published: (2023)

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
by: Balbi, Pedro Paulo, et al.
Published: (2026)

ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results
by: Bouyssou, Denis, et al.
Published: (2024)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
by: Kaymakov, Kirill V., et al.
Published: (2024)

Efficient counting of permutation patterns via double posets
by: Diehl, Joscha, et al.
Published: (2024)

The Gray graph is pseudo 2-factor isomorphic
by: Abreu, Marien, et al.
Published: (2025)

Complexity of Injectivity and Verification of ReLU Neural Networks
by: Froese, Vincent, et al.
Published: (2024)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Record-biased permutations and their permuton limit
by: Bouvel, Mathilde, et al.
Published: (2024)

Solving systems of equations on antichains for the computation of the ninth Dedekind Number
by: De Causmaecker, Patrick, et al.
Published: (2024)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)

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

Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)

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)

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

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

Some permutation pentanomials over finite fields of even characteristic
by: Kousar, Farhana, et al.
Published: (2024)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

Size-varying reversible causal graph dynamics
by: Arrighi, Pablo, et al.
Published: (2018)

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

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

Free polynomial strong bimonoids
by: Droste, Manfred, et al.
Published: (2025)

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)

From geometry to generating functions: rectangulations and permutations
by: Asinowski, Andrei, et al.
Published: (2024)