Related papers: Minimal value set binomials and Frobenius nonclass…

This paper aims to study linear sets of minimum size in the projective line, that is $\mathbb{F}_q$-linear sets of rank $k$ in $\mathrm{PG}(1,q^n)$ admitting one point of weight one and having size $q^{k-1}+1$. Examples of these linear sets…

A resolving set for a graph $G$ is a set of vertices $Q = \{q_1, ..., q_k\}$ such that, for all $p\in V(G)$ the $k$-tuple $(d(p, q_1), ..., d(p, q_k ))$ uniquely determines $p$, where $d(p, q_i)$ is considered as the minimum length of a…

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

We introduce a special class of supersingular curves over $\mathbb{F}_{p^2}$, characterized by the existence of non-integer endomorphisms of small degree. A number of properties of this set is proved. Most notably, we show that when this…

We define the notion of holonomy group for a stable vector bundle F on a variety in terms of the Narasimhan--Seshadri unitary representation of its restriction to curves. Next we relate the holonomy group to the minimal structure group and…

We prove an inequality for the curvature of level sets of minimal graphs having vanishing boundary values and show that if the boundary is concave, then all the level sets are concave.

In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show…

We classify real families of minimal degree rational curves that cover an embedded rational surface. A corollary is that if the projective closure of a smooth surface is not biregular isomorphic to the projective closure of the unit-sphere,…

The equational probabilistic spectrum of a finite algebra is the set of probabilities with which equations are satisfied in the algebra. We study algebras with minimal spectrum, that is, spectra consisting only of the values $1$ and…

We consider four prototypes of variational problems and prove the existence of fractal minimizers through the direct method in the calculus of variations. By design these minimizers are H\"older curves or H\"older parametrizations of…

"Quaternionic" vector bundles are the objects which describe the topological phases of quantum systems subjected to an odd time-reversal symmetry (class AII). In this work we prove that the FKMM invariant provides the correct fundamental…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

The lowest eigenvalue of non-commutative harmonic oscillators $Q$ is studied. It is shown that $Q$ can be decomposed into four self-adjoint operators, and all the eigenvalues of each operator are simple. We show that the lowest eigenvalue…

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…

For a ring R and system L of linear homogeneous equations, we call a coloring of the nonzero elements of R minimal for L if there are no monochromatic solutions to L and the coloring uses as few colors as possible. For a rational number q…

We have recently showed that it is possible to deal with collections of indistinguishable elementary particles (in the context of quantum mechanics) in a set-theoretical framework by using hidden variables, in a sense. In the present paper…

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

The smallest possible number of distinct eigenvalues of a graph $G$, denoted by $q(G)$, has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(G)$ is bounded below by $k$, where $k$ is the number of…