Operations with structures
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A surprising permanence of old motivations (a not-so-rigid story)
- Cancellation among finite unary algebras
- A characterization of cancellable k-ary structures
- The fine spectrum of a variety
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Density via duality.
- Lattices arising in categorial investigations of Hedetniemi's conjecture
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Polyadic sets and homomorphism counting
- Fractional isomorphism of graphons
- Discrete density comonads and graph parameters
- Quasi-independence, homology and the unity of type: a topological theory of characters
- The isomorphism problem for group algebras: a criterion
- Graph exponentiation and neighborhood reconstruction
- A method for obtaining refinement theorems, with an application to direct products of semigroups
- Powers of ordered sets
- Strengthening topological colorful results for graphs
- Double graphs
- The rank of connection matrices and the dimension of graph algebras
- On the cancellation law among finite relational structures
- Categorial quasivarieties
- Chromatic numbers and products
- Unique list-colourability and the fixing chromatic number of graphs
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights
- Approximately counting \(H\)-colorings is \(\#\)BIS-hard
- A complete dichotomy rises from the capture of vanishing signatures
- The complexity of counting homomorphisms to cactus graphs modulo 2
- Counting homomorphisms to sparse graphs
- Many Facets of Dualities
- Progress in complexity of counting problems
- On recognizing graphs by numbers of homomorphisms
- The structure of locally finite varieties with polynomially many models
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- scientific article; zbMATH DE number 4214086 (Why is no real title available?)
- Approximately counting \(H\)-colourings is \(\#\mathrm{BIS}\)-hard
- Mixing homomorphisms, recolorings, and extending circular precolorings
- The contributions of Alfred Tarski to general algebra
- The complexity of Boolean Holant problems with nonnegative weights
- Constructing cospectral graphs via a new form of graph product
- scientific article; zbMATH DE number 2172849 (Why is no real title available?)
- Monoid-labeled transition systems
- Lov\'asz Meets Weisfeiler and Leman
- Counting problems in parameterized complexity
- Structure and Power: an Emerging Landscape
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- From \(\mathrm{Hom}(A,X)\cong\mathrm{Hom}(B,X)\) to \(A\cong B\)
- scientific article; zbMATH DE number 7559390 (Why is no real title available?)
- Counting connected subgraphs with maximum-degree-aware sieving
- Counting Answers to Existential Questions
- The Complexity of Homomorphism Indistinguishability
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- The complexity of counting surjective homomorphisms and compactions
- Classification of a Class of Counting Problems Using Holographic Reductions
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Algebras in permutable varieties: Geometrical properties of affine algebras
- Graphon convergence of random cographs
- Does the endomorphism poset $P^P$ determine whether a finite poset $P$ is connected? An issue Duffus raised in 1978
- Quantum isomorphism of graphs from association schemes
- Reconcilable differences
- Containment of conjunctive queries on annotated relations
- Distinguishing graphs by their left and right homomorphism profiles
- Advances in quantum permutation groups
- The complexity of counting planar graph homomorphisms of domain size 3
- Recognizing graph products and bundles
- The pebble-relation comonad in finite model theory
- Algebraic global gadgetry for surjective constraint satisfaction
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
- Logical equivalences, homomorphism indistinguishability, and forbidden minors
- The pebble-relation comonad in finite model theory
- Combinatorics in (2,1)-categories
- A dichotomy for bounded degree graph homomorphisms with nonnegative weights
- Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Finding the prime factors of strong direct product graphs in polynomial time
- On cospectral graphons
- Equality on all \#CSP instances yields constraint function isomorphism via interpolation and intertwiners
- On homomorphism indistinguishability and hypertree depth
- Graph isomorphism and multivariate graph spectrum
- Semisimple field theories detect stable diffeomorphism
- When do homomorphism counts help in query algorithms?
- Homomorphism-distinguishing closedness for graphs of bounded tree-width
- Improving graph neural networks through feature importance learning
- Modal logic with relations over paths: a theoretical development through comonadic semantics
- On algorithms based on finitely many homomorphism counts
- Planar \#CSP equality corresponds to quantum isomorphism -- a Holant viewpoint
- The set-theoretic Yang-Baxter equation, Kimura semigroups and functional graphs
- Bounded degree nonnegative counting CSP
- Quantum automorphisms of matroids
- Monotonicity of the cops and robber game for bounded depth treewidth
- An algorithmic meta theorem for homomorphism indistinguishability
- Graph similarity and homomorphism densities
- Homomorphism counts to trees
- A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
- Going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Adaptive query algorithms for relational structures based on homomorphism counts
- Homomorphism indistinguishability and game comonads for restricted conjunction and requantification
- NPA hierarchy for quantum isomorphism and homomorphism indistinguishability
- P-time algorithms for typical \#EO problems
- Subgraph counting in subquadratic time for bounded degeneracy graphs
- The converse of the real orthogonal Holant theorem
This page was built for publication: Operations with structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5561941)
