Related papers: Dynamical GCD Problems and a Variant of the Dynami…
A complete classification of the computational complexity of the fixed-point existence problem for boolean dynamical systems, i.e., finite discrete dynamical systems over the domain {0, 1}, is presented. For function classes F and graph…
We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…
We characterize the irreducible polynomials that occur as a characteristic polynomial of an automorphism of an even unimodular lattice of given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general…
It has been shown that a global minimizer of a smooth determinant of a matrix function corresponds to the largest cycle of a graph. When it exists, this is a Hamiltonian cycle. Finding global minimizers even of a smooth function is a…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
We define arithmetical and dynamical degrees for dynamical systems with several rational maps on projective varieties, study their properties and relations, and prove the existence of a canonical height function associated with divisorial…
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…
We investigate generalizations along the lines of the Mordell--Lang conjecture of the author's $p$-adic formal Manin--Mumford results for $n$-dimensional $p$-divisible formal groups $\mathcal{F}$. In particular, given a finitely generated…
Recently, Peter Doyle and Curt McMullen devised an iterative solution to the fifth degree polynomial. At the method's core is a rational mapping of the Riemann sphere with the icosahedral symmetry of a general quintic. Moreover, this map…
The recent results of An, Luan, and Yen [Differential stability in convex optimization via generalized polyhedrality. Vietnam J. Math. https://-doi.org/10.1007/s10013-024-00721-y] on differential stability of parametric optimization…
The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…
The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…
We study in this paper Hida's p-adic Hecke algebra for GL_n over a CM field F. Hida has made a conjecture about the dimension of these Hecke algebras, which he calls the non-abelian Leopoldt conjecture, and shown that his conjecture in the…
We establish consequences of the moving form of Schmidt's Subspace Theorem. Indeed, we obtain inequalities that bound the logarithmic greatest common divisor of moving multivariable polynomials evaluated at moving $S$-unit arguments. In…
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
We study almost automorphic solutions of the discrete delayed neutral dynamic system% \[ x(t+1)=A(t)x(t)+\Delta Q(t,x(t-g(t)))+G(t,x(t),x(t-g(t))) \] by means of a fixed point theorem due to Krasnoselskii. Using discrete variant of…
We provide a primal-dual framework for randomized approximation algorithms utilizing semidefinite programming (SDP) relaxations. Our framework pairs a continuum of APX-complete problems including MaxCut, Max2Sat, MaxDicut, and more…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
In this article, we study a generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d$-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk…