Related papers: AE regularity of interval matrices
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
Cointegration is an important topic for time-series, and describes a relationship between two series in which a linear combination is stationary. Classically, the test for cointegration is based on a two stage process in which first the…
The inner alignment problem, which asserts whether an arbitrary artificial intelligence (AI) model satisfices a non-trivial alignment function of its outputs given its inputs, is undecidable. This is rigorously proved by Rice's theorem,…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
A common problem in numerous research areas, particularly in clinical trials, is to test whether the effect of an explanatory variable on an outcome variable is equivalent across different groups. In practice, these tests are frequently…
We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
A matrix \( A \) is called \emph{kernel partition regular} if, for every finite coloring of the natural numbers \( \mathbb{N} \), there exists a monochromatic solution to the equation \( A\vec{X} = 0 \). In 1933, Rado characterized such…
Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are…
We deal with interval parametric systems of linear equations and the goal is to solve such systems, which basically comes down to finding an enclosure for a parametric solution set. Obviously we want this enclosure to be as tight as…
In this paper we presents further developments regarding the enrichment of the basic Theory of Order Completion. In particular, spaces of generalized functions are constructed that contain generalized solutions to all systems of continuous,…
Set-theoretical, physical, and intuitive notions of continuum are compared. It is shown that the independence of the continuum hypothesis determines status and properties of the set of intermediate cardinality. The intermediate set is a…
We consider Nehari's problem in the case of non-uniqueness of solution. The solution set is then parametrized by the unit ball of $H^{\infty}$ by means of so-called {\em regular generators} -- bounded holomorphic functions $\phi$. The…
We consider a special form of parametric generalized equations arising from electronic circuits with AC sources and study the effect of perturbing the input signal on solution trajectories. Using methods of variational analysis and strong…