ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Question Can either of the following be expressed in fixed-point logic plus counting:

  • Given a graph, does it have a perfect matching, i.e., a set MM of edges such that every vertex is incident to exactly one edge from MM?
  • Given a square matrix over a finite field (regarded as a structure in the natural way, as described in [BGS02]), what is its determinant?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.