Related papers: Infinite characters of type II on $SL_n(\mathbb{Z}…

We consider the existence of solutions for nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearities. In an $L^2$-supercritical regime, we establish the existence of infinitely many solutions for any…

We prove configuration results for extremal Type II codes, analogous to the configuration results of Ozeki and of the second author for extremal Type II lattices. Specifically, we show that for $n \in \{8, 24, 32, 48, 56, 72, 96\}$ every…

It is known that the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$ has a finite generating set. In this paper, we give a finite presentation of the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$.

We construct a 2-generator recursively presented group with infinite torsion length. We also explore the construction in the context of solvable and word-hyperbolic groups.

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.

Let $n>1$ be an integer. The algebras of the title, which we abbreviate as algebras of type $n$, are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, which are generated by an element of degree $1$ and an element…

In this paper, the author introduces the concept and basic properties of finite (commutative) hyperfields. Also, the author shows that, up to isomorphism, there are exactly 2 hyperfields of order 2; 5 hyperfields of order 3; 7 hyperfields…

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

We reconstruct a complete type II superstring field theory with L-infinity structure in a symmetric way concerning the left- and right-moving sectors. Based on the new construction, we show again that the tree-level S-matrix agrees with…

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

We construct an sl(2)-action on the equivariant skein lasagna module.

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

The covering number of a non-linear character $\chi$ of a finite group $G$ is the least positive integer $k$ such that every irreducible character of $G$ occurs in $\chi^k$. We determine the covering numbers of irreducible characters of the…

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

We open a new field on how one can define means on infinite sets. We investigate many different ways on how such means can be constructed. One method is based on sequences of ideals, other deals with accumulation points, one uses isolated…

Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.

The problem of computing the characters of the finite dimensional irreducible representations of the Lie superalgebra $\mathfrak q(n)$ over $\C$ was solved in 1996 by I. Penkov and V. Serganova. In this article, we give a different approach…