On two relations characterizing the golden ratio

V.G. Zhuravlev found two relations associated with the golden ratio: $\tau=\frac{1+\sqrt{5}}{2}$: $[([i\tau]+1)\tau]=[i\tau^2]+1$ and $[[i\tau]\tau]+1=[i\tau^2]$. We give a new elementary proof of these relations and show that they give a characterization of the golden ratio. Further we consider satisfability of our relations for finite sets of $i$-s and establish some forcing property for this situation.

Stability in the homology of Deligne–Mumford compactifications

Using the theory of ${\mathbf {FS}} {^\mathrm {op}}$ modules, we study the asymptotic behavior of the homology of ${\overline {\mathcal {M}}_{g,n}}$ , the Deligne–Mumford compactification of the moduli space of curves, for $n\gg 0$ . An ${\mathbf {FS}} {^\mathrm {op}}$ module is a contravariant functor from the category of finite sets and surjections to vector spaces. Via copies that glue on marked projective lines, we give the homology of ${\overline {\mathcal {M}}_{g,n}}$ the structure of an ${\mathbf {FS}} {^\mathrm {op}}$ module and bound its degree of generation. As a consequence, we prove that the generating function $\sum _{n} \dim (H_i({\overline {\mathcal {M}}_{g,n}})) t^n$ is rational, and its denominator has roots in the set $\{1, 1/2, \ldots, 1/p(g,i)\},$ where $p(g,i)$ is a polynomial of order $O(g^2 i^2)$ . We also obtain restrictions on the decomposition of the homology of ${\overline {\mathcal {M}}_{g,n}}$ into irreducible $\mathbf {S}_n$ representations.

Integrating Cardinality Constraints into Constraint Logic Programming with Sets

Formal reasoning about finite sets and cardinality is important for many applications, including software verification, where very often one needs to reason about the size of a given data structure. The Constraint Logic Programming tool $$\{ log\} $$ provides a decision procedure for deciding the satisfiability of formulas involving very general forms of finite sets, although it does not provide cardinality constraints. In this paper we adapt and integrate a decision procedure for a theory of finite sets with cardinality into $$\{ log\} $$ . The proposed solver is proved to be a decision procedure for its formulas. Besides, the new CLP instance is implemented as part of the $$\{ log\} $$ tool. In turn, the implementation uses Howe and King’s Prolog SAT solver and Prolog’s CLP(Q) library, as an integer linear programming solver. The empirical evaluation of this implementation based on +250 real verification conditions shows that it can be useful in practice. Under consideration in Theory and Practice of Logic Programming (TPLP)

On minimal log discrepancies and kollár components

In this article, we prove a local implication of boundedness of Fano varieties. More precisely, we prove that $d$ -dimensional $a$ -log canonical singularities with standard coefficients, which admit an $\epsilon$ -plt blow-up, have minimal log discrepancies belonging to a finite set which only depends on $d,\,a$ and $\epsilon$ . This result gives a natural geometric stratification of the possible mld's in a fixed dimension by finite sets. As an application, we prove the ascending chain condition for minimal log discrepancies of exceptional singularities. We also introduce an invariant for klt singularities related to the total discrepancy of Kollár components.