Related papers: Pseudo-Prikry sequences
Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group $G$ are combinatorial designs raised by Paterson and Stinson [7] in 2016 and have applications in communication theory to construct…
Continuing the study of Hamiltonian pseudo-rotations of projective spaces, we focus on the conjecture that the fixed-point data set (the actions and the linearized flows at one-periodic orbits) of a pseudo-rotation exactly matches that data…
We introduce a novel, logic-independent framework for the study of sequent-style proof systems, which covers a number of proof-theoretic formalisms and concrete proof systems that appear in the literature. In particular, we introduce a…
We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…
Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results in set theory. We show the relative consistency of ZF + DC + there exists a sequence of subsets of R the…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…
This work deals with defect structures in models described by scalar fields. The investigations focus on generalized models, with the kinetic term modified to allow for a diversity of possibilities. We develop a new framework, in which we…
The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.
The phenomenon of gyroscopic precession is studied within the framework of Frenet-Serret formalism adapted to quasi-Killing trajectories. Its relation to the congruence vorticity is highlighted with particular reference to the irrotational…
Quasi-conformal actions were introduced in the physics literature as a generalization of the familiar fractional linear action on the upper half plane, to Hermitian symmetric tube domains based on arbitrary Jordan algebras, and further to…
In the framework of abstract linear inverse problems in infinitedimensional Hilbert space we discuss generic convergence behaviours of approximate solutions determined by means of general projection methods, namely outside the standard…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
We consider a trace theorem for self-similar Dirichlet forms on self-similar sets to self-similar subsets. In particular, we characterize the trace of the domains of Dirichlet forms on the Sierpinski gaskets and the Sierpinski carpets to…
Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with the domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ is combinatorially similar to $\Psi$ if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…
Sequential pattern mining under constraints is a challenging data mining task. Many efficient ad hoc methods have been developed for mining sequential patterns, but they are all suffering from a lack of genericity. Recent works have…
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…
We have recently showed that it is possible to deal with collections of indistinguishable elementary particles (in the context of quantum mechanics) in a set-theoretical framework by using hidden variables, in a sense. In the present paper…
There are certain countably generated sigma-algebras of sets in the real line which do not admit any non-zero, sigma-finite, diffused (or, continuous) measure. Such countably generated sigma-algebras can be obtained by the use of some…