Related papers: On norming systems of linear equations
Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…
A set $P\subset \mathbb N$ is called predictive if for any zero entropy finite-valued stationary process $(X_i)_{i\in \mathbb Z}$, $X_0$ is measurable with respect to $(X_i)_{i\in P}$. We know that $\mathbb N$ is a predictive set. In this…
This paper studies linear time-invariant descriptor systems which are not necessarily regular. We introduce the notion of partial detectability and characterize this concept by means of a simple rank criterion involving the system…
Linear systems on Lie groups are a natural generalization of linear system on Euclidian spaces. When the state space is a solvable connected Lie group, controllability of the linear system is assured if the ad-rank condition holds.
In the paper I study properties of random polynomials with respect to a general system of functions. Some lower bounds for the mathematical expectation of the uniform and recently introduced integral-uniform norms of random polynomials are…
Newton flows are dynamical systems generated by a continuous, desingularized Newton method for mappings from a Euclidean space to itself. We focus on the special case of meromorphic functions on the complex plane. Inspired by the analogy…
Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…
Rule-based reasoning over natural language input arises in domains where decisions must be auditable and justifiable: clinical protocols specify eligibility criteria in prose, evidence rules define admissibility through textual conditions,…
Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…
Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…
The dependently-typed lambda calculus LF is often used as a vehicle for formalizing rule-based descriptions of object systems. Proving properties of object systems encoded in this fashion requires reasoning about formulas over LF typing…
Herein, we present a canonical form for a natural and necessary generalization of the Lambert W function, natural in that it requires minimal mathematical definitions for this generalization, and necessary in that it provides a means of…
We study hyperbolic systems of one-dimensional partial differential equations under general, possibly non-local boundary conditions. A large class of evolution equations, either on individual 1-dimensional intervals or on general networks,…
We introduce a linearly ordered set Z and use it to prove a necessity condition for the existence of a G\^ateaux smooth norm on C(T), where T is a tree. This criterion is directly analogous to the corresponding equivalent condition for…
This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation,…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
Let $\mathcal{H}$ be the class of bounded measurable symmetric functions on $[0,1]^2$. For a function $h \in \mathcal{H}$ and a graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ and edge set $E(G)$, define \[ t_G(h) \; = \; \int \cdots \int…
We define a linear homogeneous equation to be strongly r-regular if, when a finite number of inequalities is added to the equation, the system of the equation and inequalities is still r-regular. In this paper, we show that, if a linear…
This paper considers the classification of linear subspaces with mismatched classifiers. In particular, we assume a model where one observes signals in the presence of isotropic Gaussian noise and the distribution of the signals conditioned…