Related papers: Full normalization for transfinite stacks
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a…
In this paper, we investigate the power of {\it regularization}, a common technique in reinforcement learning and optimization, in solving extensive-form games (EFGs). We propose a series of new algorithms based on regularizing the payoff…
Discrete statistical models supported on labelled event trees can be specified using so-called interpolating polynomials which are generalizations of generating functions. These admit a nested representation. A new algorithm exploits the…
We present a canonical extension of topological dynamics to transfinite iterations, which makes precise the idea of dynamical phenomena stabilizing at different time-scales. Specifically, consider a sequence of self-maps $F=\{f_n\}$ of a…
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run…
The paper presents a novel, parameter free, density evaluation method for topology optimization based on normalized product of a scalar field. The approach imposes length scale on solid phase implicitly and allows for pure 0-1 singularity…
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…
We study normalisation of multistep strategies, strategies that reduce a set of redexes at a time, focussing on the notion of necessary sets, those which contain at least one redex that cannot be avoided in order to reach a normal form.…
We identify a premouse inner model $L[\mathbb{E}]$, such that for any coarsely iterable background universe $R$ modelling $\mathrm{ZFC}$, $L[\mathbb{E}]^R$ is a proper class premouse of $R$ inheriting all strong and Woodin cardinals from…
We show that the theory $I\Sigma_1$ of $\Sigma_1$-induction proves the following statement: For all $n\geq 2$, the uniform $\Sigma_1$-reflection principle over the theory $I\Sigma_n$ is equivalent to the totality of the function…
The rise of machine learning methods on heavily resource constrained devices requires not only the choice of a suitable model architecture for the target platform, but also the optimization of the chosen model with regard to execution time…
We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question of Solovay in the late 1960's regarding first failures of distributivity. Given a strictly increasing sequence of regular cardinals $\langle…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
In this paper, a general class of regularized $M$-estimators of scatter matrix are proposed which are suitable also for low or insufficient sample support (small $n$ and large $p$) problems. The considered class constitutes a natural…
One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…
Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subscribe systems both in centralized and distributed contexts.…
In this paper, we extend the notion of a merge tree to that of a generalized merge tree, a merge tree that includes 1-dimensional cycle birth information. Given a discrete Morse function on a $1$-dimensional regular CW complex, we construct…
We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infnite memory chains for which the family of transition probabilities is represented by a probabilistic…
In this paper, we introduce a birationally admissible stratification on the Deligne-Mumford stack of stable minimal models (e.g., the KSBA moduli stack), such that the universal family over each stratum admits a simple normal crossing log…