SearcharxivSearch

arXiv subjects

Martin Raška

Publications and source records attributed to Martin Raška.

5 recordsLinked to original sources

The Six-Vertex Model with a Non-Standard Boundary Condition

We consider the enumeration of states in the Brubaker-Bump-Friedberg six-vertex model, whose boundary conditions are determined by an integer partition. In general, we find the number of states is a polynomial in the largest part of the partition. By explicating this technique, we also enumerate the states completely for hook shapes and staircases.

math.CO

Pythagoras numbers of orders in biquadratic fields

We examine the Pythagoras number $\mathcal{P}(\mathcal{O}_K)$ of the ring of integers $\mathcal{O}_K$ in a totally real biquadratic number field $K$. We show that the known upper bound $7$ is attained in a large and natural infinite family of such fields. In contrast, for almost all fields $\mathbb{Q}(\sqrt5, \sqrt{s})$ we prove $\mathcal{P}(\mathcal{O}_K)=5$. Further we show that $5$ is a lower bound for all but seven fields $K$ and $6$ is a lower bound in an asymptotic sense.

math.NT

Representing multiples of $m$ in real quadratic fields as sums of squares

We study real quadratic fields $\mathbb{Q}(\sqrt{D})$ such that, for a given rational integer $m$, all $m$-multiples of totally positive integers are sums of squares. We prove quite sharp necessary and sufficient conditions for this to happen. Further, we give a fast algorithm that solves this question for specific $m$, $D$ and we give complete results for $m \leq 5000$.

math.NT

Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL

Many facts possess symmetrical counterparts that often require a separate formal proof, depending on the nature of the involved symmetry. We introduce a method in Isabelle/HOL which produces such a symmetrical fact for the list datatype and the symmetry induced by the list reversal mapping. The method is implemented as an attribute and its result is based on user-declared symmetry rules. Besides general rules, we provide rules that are aimed to be applied in the domain of Combinatorics on Words.

cs.LO

Binary codes that do not preserve primitivity

A code $X$ is not primitivity preserving if there is a primitive list ${\mathbf w} \in {\tt lists} X$ whose concatenation is imprimitive. We formalize a full characterization of such codes in the binary case in the proof assistant Isabelle/HOL. Part of the formalization, interesting on its own, is a description of $\{x,y\}$-interpretations of the square $xx$ if $|y| \leq |x|$. We also provide a formalized parametric solution of the related equation $x^jy^k = z^\ell$.

cs.FL