Related papers: On the existence of a strong minimal pair

We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…

We establish the validity of a strong unique continuation property for weakly coupled elliptic systems, including competitive ones. Our proof exploits the system structure and uses Carleman estimates. We apply this result to obtain some…

We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…

We give a classification of the principal and distinguished nilpotent pairs in all classical Lie algebras. As a classification of the principal pairs in the exceptional simple Lie algebras was obtained earlier (see Appendix to Ginzburg's…

Using a new definition of rank for representations of semisimple groups sharp results are proved for the decay of matrix coefficients of unitary representations of two types of non-split $p$-adic simple algebraic groups of exceptional type.…

We define a topological invariant of complex projective plane curves. As an application, we present new examples of arithmetic Zariski pairs.

We obtain sharp upper bounds for three-term segments of a bounded power series. Along the way we show that the Taylor polynomials of a certain algebraic function do not vanish in the unit disk.

The Known Menger's theorem states that in a finite graph, the size of a minimum separator set of any pair of vertices is equal to the maximum number of disjoint paths that can be found between these two vertices. In this paper, we study the…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

We introduce a notion of strong periodicity of a module over a finite-dimensional algebra over a field. We prove that the existence of such modules over certain idempotent algebras is both a necessary and sufficient condition for the…

We show the existence of a unitriangular basic set for unipotent blocks simple reductive groups of classical type in bad characteristic with some exceptions. Then,we introduce an algorithm to count irreducible unipotent Brauer characters…

Several researchers have recently established that for every Turing degree $\boldsymbol{c}$, the real closed field of all $\boldsymbol{c}$-computable real numbers has spectrum $\{\boldsymbol{d}~:~\boldsymbol{d}'\geq\boldsymbol{c}"\}$. We…

We construct a moduli space of stable projective pairs with a nontrivial action of a connected reductive group. These stable reductive pairs are higher-dimensional analogs of stable n-pointed curves and generalize to the non-commutative…

In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.

A short proof to a recent theorem of Giambruno and Mishchenko is given in this note.

We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.

We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…

Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…