SearcharxivSearch

arXiv subjects

Dmitry I. Khomovsky

Publications and source records attributed to Dmitry I. Khomovsky.

8 recordsLinked to original sources

Symmetry reductions and recurrence degrees for banded Toeplitz determinants and permanents

This paper studies symmetry-induced reductions of scalar recurrence complexity for balanced banded Toeplitz determinants and permanents. Three mechanisms emerge: determinant state and spectral compression, exceptional permanent--determinant conversion, and symmetries of permanent state spaces. For symmetric determinants, straightening reduces the row-column states from $\binom{2m}{m}$ to the Catalan number $C_{m+1}$; primitive symplectic weight compression then leaves $(3^m+1)/2$ distinct autonomous modes. Skew symmetry has a parallel compound/Hodge explanation: the middle exterior representation splits into two Hodge halves of dimension $\binom{2m}{m}/2$, the one-step compound transfer exchanges the halves, and its two-step restriction has $3^{m-1}$ generic ternary modes. Thus the full skew bound is $2\cdot3^{m-1}$. Widom--Hankel arguments prove generic scalar minimality in both symmetry classes, and every even skew Toeplitz determinant admits an explicit half-size square factorization. For the zero-diagonal pentadiagonal support, a Pólya--Kasteleyn signing converts every permanent to a determinant. Among consecutive zero-diagonal two-sided bands, universal entrywise conversion---and separately Toeplitz diagonal-wise conversion---occurs only in the Hessenberg families and this pentadiagonal case. Paired renewal identities recover all restored-diagonal determinant and permanent layers. For permanents, transposition gives the open symmetric bound $(\binom{2m}{m}+2^m)/2$, while cyclic defect-sector pairing gives $(4^m+\binom{2m}{m})/2$. Skew-symmetry forces odd-size vanishing and corresponding even-subsequence bounds. In semibandwidth two the open symmetric bound is generically sharp; higher-semibandwidth permanent minimality is left separate from the symmetry reductions proved here.

math.RA

Constructive recurrences for determinants and permanents of banded Toeplitz matrices

For fixed nonnegative integers $m_1,m_2$, let $A_n=(a_{j-i})_{i,j=1}^n$ be the leading $n\times n$ section of a Toeplitz matrix with lower and upper semibandwidths $m_1$ and $m_2$. We give two constructive Laplace-expansion methods for scalar recurrences of $\det A_n$ and $\perm A_n$. The increasing-rows method eliminates a fixed family of boundary cofactors and gives recurrence order at most $d=\binom{m_1+m_2}{m_1}$ for both sequences. The row-column method closes normalized boundary minors recursively and packages them in a sparse transfer matrix. Its reachable states are classified exactly: level $j$ is indexed by a pair of $j$-subsets of $[m_1]$ and $[m_2]$. Hence the transfer dimension is $d$, and we obtain an explicit formula for the number of nonzero transitions. For determinants, the complementary cofactors of the increasing-rows construction are coordinates of the classical compound companion representation. The independently constructed row-column transfer has the Widom characteristic polynomial and is generically similar to the compound transfer. Thus the order $d$ recurrence is generically minimal for the unrestricted fixed-band determinant family. For permanents the same state graph gives the binomial upper bound, without a general minimality claim. The pentadiagonal case recovers Sweet's order-six determinant recurrence and its permanent analogue, while the one-superdiagonal family gives closed scalar recurrences and rational generating functions. Position-dependent band weights preserve the finite state graph but replace the constant transfer by a cocycle. For cyclic determinants, Fourier diagonalization produces all subset products of the symbol roots and a generically minimal annihilator of degree $2^{m_1+m_2}$, corresponding to the passage from one exterior degree to the full exterior algebra.

math.RA

On natural densities of sets of some type integers

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in $\bigcup_{j=1}^{n}[a_j,b_j]$. The following formula holds: $$\lim_{x\to\infty}{\frac{Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)}{x}}=\prod\limits_{p}\sum\limits_{i=0}^{n}\left(\frac{1}{p^{a_{i}}}-\frac{1}{p^{b_{i}+1}}\right).$$ In this paper, we prove this result and then generalize it.

math.NT

On using symmetric polynomials for constructing root finding methods

We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the existing root finding methods. The new results presented in this paper are some modifications of the Durand-Kerner method.

math.NA

A method for obtaining Fibonacci identities

For the Lucas sequence $\{U_{k}(P,Q)\}$ we discuss the identities such as the well-known Fibonacci identities. We also propose a method for obtaining identities involving recurrence sequences. With the help of which we find an interpolating type identity for second order linear recurrences.

math.NT

Efficient computation of terms of linear recurrence sequences of any order

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence. Unlike Fiduccia's algorithm our approach uses certain formulas for modular polynomial squarings.

math.NT

A geometric approach to integer factorization

We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.

math.NT

On the relationship between the number of solutions of congruence systems and the resultant of two polynomials

Let $q$ be an odd prime and $f(x)$, $g(x)$ be polynomials with integer coefficients. If the system of congruences $f(x) \equiv g(x) \equiv 0 \pmod{q}$ has $\ell$ solutions, then $R\left(f(x),g(x)\right)\equiv 0 \pmod{q^\ell}$, where $R\left(f(x),g(x)\right)$ is the resultant of the polynomials. Using this result we give new proofs of some known congruences involving the Lucas sequences.

math.NT