Related papers: Salem numbers and Pisot numbers via interlacing
Apollonian gaskets are formed by repeatedly filling the gaps between three mutually tangent circles with further tangent circles. In this paper we give explicit formulas for the the limiting pair correlation and the limiting nearest…
Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
In this rather computational paper, we determine certain representation numbers of ideals in real quadratic number fields explicitly in order to obtain a representation of the associated Dirichlet series in terms of Dirichlet L-functions…
We establish the existence of at least one solution to a system of two semilinear coupled Poisson equations with asymptotically linear nonlinearities, without imposing the Ambrosetti-Rabinowitz condition or any of its refinements. The proof…
An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…
We study symplectic linear algebra over the ring $\Rt$ of Colombeau generalized numbers. Due to the algebraic properties of $\Rt$ it is possible to preserve a number of central results of classical symplectic linear algebra. In particular,…
This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…
We systematically explore a class of constrained optimization problems with linear objective function and constraints that are linear combinations of logarithms of the optimization variables. Such problems can be viewed as a generalization…
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann {\zeta} function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…
As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…