Related papers: In how many distinct ways can flocks be formed? A …
Given a locally cartesian closed category E, a polynomial (s,p,t) may be defined as a diagram consisting of three arrows in E of a certain shape. In this paper we define the homogeneous and monomial terms comprising a polynomial (s,p,t) and…
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…
Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…
For a coalgebra $C_k$ over field $k$, we define the "coalgebra extension problem" as the question: what multiplication laws can we define on $C_k$ to make it a bialgebra over $k$? This paper answers this existence-uniqueness question for…
P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…
In this note we focus on combinatorial aspects of plus-one generated line arrangements. We provide combinatorial constraints on such arrangements and we construct a polynomial that decodes the plus-one generated property. We present new…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…
We construct an extension of the Poincare group which involves a mixture of internal and space-time supersymmetries. The resulting group is an extension of the superPoincare group with infinitely many generators which carry internal and…
We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…
A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…
Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…
Let $K$ be a local field with finite residue field, we define a normal form for Eisenstein polynomials depending on the choice of a uniformizer $\pi_K$ and of residue representatives. The isomorphism classes of extensions generated by the…
A polynomial ensemble is a probability density function for the position of $n$ real particles of the form $\frac{1}{Z_n} \, \prod_{j<k} (x_k-x_j) \, \det \left[ f_k (x_j) \right]_{j,k=1}^n$, for certain functions $f_1, \ldots, f_n$. Such…
Given a sequence of polynomials $(p_n)_n$, an algebra of operators $\mathcal{A}$ acting in the linear space of polynomials and an operator $D_p\in \mathcal{A}$ with $D_p(p_n)=np_n$, we form a new sequence of polynomials $(q_n)_n$ by…
The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…
A pedigree is a directed graph in which each vertex (except the founder vertices) has two parents. The main result in this paper is a construction of an infinite family of counter examples to a reconstruction problem on pedigrees, thus…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
The associative ring $R(P(t))=\mathbb C[t^{\pm1},u \,|\, u^2=P(t)]$, where $P(t)=\sum_{i=0}^na_it^i=\prod_{k=1}^n(t-\alpha_i)$ with $\alpha_i\in\mathbb C$ pairwise distinct, is the coordinate ring of a hyperelliptic curve. The Lie algebra…