Related papers: Wilf's conjecture in fixed multiplicity

We prove an effective version of the Pila-Wilkie Theorem for sets definable using Pfaffian functions, providing effective estimates for the number of algebraic points of bounded height and degree lying on such sets. We also prove effective…

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…

We demonstrate the truth of the sunflower conjecture by showing that a family $\mathcal{F}$ of sets each of cardinality at most $m$ includes a $k$-sunflower, if $|\mathcal{F}| > ( c k )^{2m}$ for a constant $c>0$ independent of $m$ and $k$,…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

The Huneke-Wiegand conjecture is a decades-long open question in commutative algebra. Garc\'ia-S\'anchez and Leamer showed that a special case of this conjecture concerning numerical semigroup rings $\Bbbk[\Gamma]$ can be answered in the…

Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

It is known that in the case of hyperelliptic curves the Shafarevich conjecture can be made effective, i.e., for any number field k and any finite set of places S of k, one can effectively compute the set of isomorphism classes of…

As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization. The algorithm can be configured to run in…

We consider three graphs, $G_{7,3}$, $G_{7,4}$, and $G_{7,6}$, related to Keller's conjecture in dimension 7. The conjecture is false for this dimension if and only if at least one of the graphs contains a clique of size $2^7 = 128$. We…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

We classify all finite-dimensional Hopf algebras over an algebraically closed field of characteristic zero such that its coradical is isomorphic to the algebra of functions over a dihedral group D_m, with m=4a> 11. We obtain this…

Wilf partitions are partitions of an integer $n$ in which all nonzero multiplicities are distinct. On his webpage, the late Herbert Wilf posed the problem to find "any interesting theorems" about the number f(n) of those partitions.…

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma…

We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from combinatorial design theory and increase the bounds to which…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…