Related papers: Quantitative aspects of linear and affine closed l…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…
We show that, also within the class of representation-tame finite dimensional algebras $\Lambda$, the big left finitistic dimension of $\Lambda$ may be strictly larger than the little. In fact, the discrepancies $Findim \Lambda - findim…
In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are…
This paper is a new contribution to the study of regular subgroups of the affine group $AGL_n(F)$, for any field $F$. In particular we associate to any partition $\lambda\neq (1^{n+1})$ of $n+1$ abelian regular subgroups in such a way that…
The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we construct languages Lr,k which can be recognized by NFA's with…
An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair shared-memory adversaries. The…
Serre obtained a sharp bound on how often two irreducible degree $n$ complex characters of a finite group can agree, which tells us how many local factors determine an Artin $L$-function. We consider the more delicate question of finding a…
Using standard methods for studying singularities of projections and of contacts, we classify the stable singularities of affine $\lambda$-equidistants of $n$-dimensional closed submanifolds of $\mathbb R^q$, for $q\leq 2n$, whenever…
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Let $A$ be an algebra with fixed set of generators $a_1,\dots,a_s$. $V_A(n)$ be dimension of the space, generated by worlds of length $\le n$ over $a_i$, $T_A(n)=V_A(n)-V_A(n-1)$. If $T_A(n)<\mbox{Const}$, algebra $A$ is a {\it boundary…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to compute a closed-form upper bound on that recurrence. We give…
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, quadratic and cubic bounds. For quadratic bounds, we use affine…
Inspired by the bad scientist who keeps repeating an experiment 20 times to get a single outcome with $p < 0.05$, we consider matrices $A \in \mathbb{R}^{n \times n}$ whose rows are normalized in $\ell^2$ and for which $2^{-n}\sum_{x \in…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
Symmetric Positive Definite (SPD) matrices have been widely used in medical data analysis and a number of different Riemannian met-rics were proposed to compute with them. However, there are very few methodological principles guiding the…
Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…
We shall show that there exist only finitely many nondegenerate three-term Machin-type formulae and give explicit upper bounds for the sizes of variables.