Related papers: On the Linear Combinants of a Binary Pencil
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We want to bound the symbol length of classes in ${_{2^{m-1}}Br}(F)$ which are represented by tensor products of 5 or 6 cyclic algebras of degree $2^m$. The main ingredients are the chain lemma for quadratic forms, a form of a generalized…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
The complete characterization of the Kronecker structure of a matrix pencil perturbed by another pencil of rank one is known, and it is stated in terms of very involved conditions. This paper is devoted to, loosing accuracy, better…
Let $-D$ be a fundamental discriminant. We express the number of representations of an integer by a positive definite binary quadratic form of discriminant $-D$ with an odd class number $h(-D)$ as a rational linear expression involving the…
Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_2\in S$ and $s_1<s_2$. Let $A$ be the set of all…
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…
Let $$\sum_{\substack{d|n\\ d\equiv 1 (2)}}\frac{1}{d}$$ denote the sum of inverses of odd divisors of a positive integer $n$, and let $c_{r}(n)$ be the number of representations of $n$ as a sum of $r$ squares where representations with…
We express the basis vectors of Cartan fundamental representations of unitary groups by binary numbers. We determine the expression of Gel'fand basis of SU (3) based on the usual subatomic quarks notations and we represent it by binary…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
Let $p$ be an odd prime, $k,\ell$ be positive integers, $q=p^k, Q=p^{\ell}$. In this paper we characterise planar functions of the form $f_{\underline{c}}(X)=c_0X^{qQ+q}+c_1X^{qQ+1}+c_2X^{Q+q}+c_3X^{Q+1}$ over $\mathbb{F}_{q^2}$ for any…
This is a continuation of the first paper (arXiv:2501.06486) of this series, where the framework for the combinatorial quantization of the 4d 2-Chern-Simons theory with an underlying compact structure Lie 2-group $\mathbb{G}$ was laid out.…
In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…
We show that the set of $n \times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some, explicitly described, complete eigenstructures. As a…
In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
In this paper, we construct the binary linear codes $C(SL(n,q))$ associated with finite special linear groups $SL(n,q)$, with both \emph{n,q} powers of two. Then, via Pless power moment identity and utilizing our previous result on the…
Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp. $c_j\subset gl(n,{\bf C})$) so that there exist irreducible $(p+1)$-tuples of…