Related papers: The Computational Complexity of the Frobenius Prob…

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

We prove the Goldbach Conjecture using p-adic analysis and algebraic methods, requiring no knowledge of prime gaps or distribution by showing counterexamples exist if and only if certain polynomials have integer solutions. Assuming, for the…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

It is currently an unsolved problem to determine whether a $\triangle$-free planar graph $G$ contains an independent set $A$ such that $G[V_G\setminus A]$ is $2$-choosable. However, in this paper, we take a slightly different approach by…

We study the complexity of classical constraint satisfaction problems on a 2D grid. Specifically, we consider the complexity of function versions of such problems, with the additional restriction that the constraints are translationally…

A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…

We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…

We study the complexity of the decision problem known as Permutation Pattern Matching, or PPM. The input of PPM consists of a pair of permutations $\tau$ (the `text') and $\pi$ (the `pattern'), and the goal is to decide whether $\tau$…

We give a categorical description of all abelian varieties with commutative endomorphism ring over a finite field with $q=p^a$ elements in a fixed isogeny class in terms of pairs consisting of a fractional $\mathbb Z[\pi,q/\pi]$-ideal and a…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

Let $R$ be a commutative Noetherian $F$-finite ring of prime characteristic and let $\mathcal{D}$ be a Cartier algebra. We define a self-map on the Frobenius split locus of the pair $(R,\mathcal{D})$ by sending a point $P$ to the splitting…

We show that the big-O problem for max-plus automata is decidable and PSPACE-complete. The big-O (or affine domination) problem asks whether, given two max-plus automata computing functions f and g, there exists a constant c such that f <…

We describe an algorithmic method of proof compression based on the introduction of Pi_2-cuts into a cut-free LK-proof. The current approach is based on an inversion of Gentzen s cut-elimination method and extends former methods for…

The study of Frobenius endomorphism provides numerous information about its corresponding Abelian variety. To understand the action of the Frobenius endomorphism, one may be interested in its eigenvalues. According to Weil's third…

The Scharlau invariant determines whether or not a finite group has a fixed point free representation over a field:\ \ if $0$, yes, otherwise, no. Until now it was known to be one of $0$, $1$, $p$, $p^2$ for $p$ a prime dividing the order…

Let p be an odd prime. Let F_p^* be the no-null part of the finite field of p elements. Let K=\Q(zeta) be a p-cyclotomic field and O_K be its ring of integers. Let pi be the prime ideal of K lying over p. Let sigma : zeta --> zeta^v be the…

The Change-Making Problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm…

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations, it is NP-complete to decide if a given set of integers…

We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all $n$-vertex cubic graphs is attained by a $2$-connected graph $G=(V,E)$. By Petersen's graph…