Related papers: Infinite characters of type II on $SL_n(\mathbb{Z}…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
We show that there are infinitely many elliptic curves $E/\mathbb{Q}$, up to isomorphism over $\overline{\mathbb{Q}}$, for which the finitely generated group $E(\mathbb{Q})$ has rank exactly $2$. Our elliptic curves are given by explicit…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$, where $cd(G)=\{\chi(1)| \chi \in Irr(G)\}$. We call such a group a GVZ-group with two character degrees. We…
An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…
We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…
We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…
The canonical components of SL_2-character varieties of arithmetic two bridge link groups are determined.
A novel notion of unpredictable strings is revealed and utilized to define deterministic unpredictable sequences on a finite number of symbols. We prove the first law of large strings for random processes in discrete time, which confirms…
In this paper we give a new formula for characters of finite dimensional irreducible $\frak{gl}(m,n)$ modules. We use two main ingredients: Su-Zhang formula and Brion's theorem.
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…
In the present paper, we will show that for any integer n>0 there are infinitely many twisted torus knots with n-string essential tangle decompositions.
It has been known for a long time that $t$-designs can be employed to construct both linear and nonlinear codes and that the codewords of a fixed weight in a code may hold a $t$-design. While a lot of progress in the direction of…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…
We describe the isomorphism classes of infinite-dimensional graded Lie algebras of maximal class, generated by elements of weight one, over fields of odd characteristic.
For every $n \in \mathbb{N}$, we construct a variety of Heyting algebras, whose $n$-generated free algebra is finite but whose $(n+1)$-generated free algebra is infinite.
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares.…
We describe the second order ODE's cubic in the first order derivative with 2-dimensional symmetry algebra. We show that there exist only eight different types of them. We also construct the easily verifiable Equivalence Criterion for every…
In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…