相关论文: Iterating the recursively Mahlo operations

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…

Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined.

Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…

Recent studies have drawn attention to the untapped potential of the "star operation" (element-wise multiplication) in network design. While intuitive explanations abound, the foundational rationale behind its application remains largely…

We prove that training neural networks on 1-D data is equivalent to solving convex Lasso problems with discrete, explicitly defined dictionary matrices. We consider neural networks with piecewise linear activations and depths ranging from 2…

It is shown that the property of being bounded below (having closed range) of weighted composition operators on Hardy and Bergman spaces can be tested by their action on a set of simple test functions, including reproducing kernels. The…

Dynamical systems generated by iterations of multivariate polynomials with slow degree growth have proved to admit good estimates of exponential sums along their orbits which in turn lead to rather stronger bounds on the discrepancy for…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

Multidimensional contractions of irreducible representations of the Cayley-Klein unitary algebras in the Gel'fand-Zetlin basis are considered. Contracted over different parameters, algebras can turn out to be isomorphic. In this case method…

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

The size $b$ of the smallest bidirectional macro scheme, which is arguably the most general copy-paste scheme to generate a given sequence, is considered to be the strictest reachable measure of repetitiveness. It is strictly lower-bounded…

The correlation between a random sequence and its transformed sequences is studied. In the case of a permutation operation or, in other word, the shuffling operation, it is shown that the correlation can be so small that the sequences can…

We investigate whether it is possible to learn rule sets efficiently in a network structure with a single hidden layer using iterative refinements over mini-batches of examples. A first rudimentary version shows an acceptable performance on…

In this paper, we provide upper and lower bounds for the region of positive recurrence for a general finite user Aloha network.

An adaptive iterative decision multi-feedback detection algorithm with constellation constraints is proposed for multiuser multi-antenna systems. An enhanced detection and interference cancellation is performed by introducing multiple…

Conservative mass limits are often imposed on the dark matter halo catalogues extracted from N-body simulations. By comparing simulations with different mass resolutions, at $z=0$ we find that even for halos resolved by 100 particles, the…

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…

An emerging and promising vision of wireless networks consists of coating the environmental objects with reconfigurable metasurfaces that are capable of modifying the radio waves impinging upon them according to the generalized law of…

Solving inverse problems with iterative algorithms is popular, especially for large data. Due to time constraints, the number of possible iterations is usually limited, potentially affecting the achievable accuracy. Given an error one is…