Related papers: A Comparison between Different Concepts of Almost …
Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing…
There are two notions of approximate Birkhoff-James orthogonality in a normed space. We characterize both the notions of approximate Birkhoff-James orthogonality in the space of bounded linear operators defined on a normed space. A complete…
We construct infinite classes of almost bent and almost perfect nonlinear polynomials, which are affinely inequivalent to any sum of a power function and an affine function.
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
The purpose of the article is to generalize the concept of approximate Birkhoff-James orthogonality, in the semi-Hilbertian structure. Given a positive operator $ A $ on a Hilbert space $ \mathbb{H}, $ we define $ (\epsilon,A)- $approximate…
The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical…
We develop a theory of polynomials and, in particular, an analog of the theory of Legendre orthogonal polynomials on the bubble-diamond fractals, a class of fractal sets that can be viewed as the completion of a limit of a sequence of…
We show the existence of a deep neural network capable of approximating a wide class of high-dimensional approximations. The construction of the proposed neural network is based on a quasi-optimal polynomial approximation. We show that this…
We introduce a generalization of the notion of approximately proper equivalence relations studied by Renault and with it we build an \'etale groupoid. Choosing a suitable set of continuous functions to play the role of a potential, we…
The strict relation between some class of multiboson hamiltonian systems and the corresponding class of orthogonal polynomials is established. The correspondence is used effectively to integrate the systems. As an explicit example we…
In recent studies, Bibiloni-Femenias, Mi\~{n}ana and Valero characterized the functions that aggregate a family of (quasi-)(pseudo)metric modulars defined over a fixed set $X$ into a single one. In this paper, we adopt a related but…
The paper is devoted to the further study of the remarkable classes of orthogonal polynomials recently discovered by Bender and Dunne. We show that these polynomials can be generated by solutions of arbitrary quasi - exactly solvable…
We present a notion of almost periodicity wich can be applied to random dynamical systems as well as almost periodic stochastic differential equations in Hilbert spaces (abstract stochastic partial differential equations). This concept…
In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…
The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…
In this paper we define a family of theories, quasi-theories, motivated by quasi-elliptic cohomology. They can be defined from constant loop spaces. With them, the constructions on certain theories can be made in a neat way, such as those…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…