Related papers: Regular sequences and synchronized sequences in ab…
This paper shows how numerical methods on a regular grid in a box can be used to generate numerical schemes for problems in general smooth domains contained in the box with no need for a domain specific discretization. The focus is mainly…
This paper deals with a family of spatial rational curves that were introduced by Andradas, Recio and Sendra, under the name of hypercircles, as an algorithmic cornerstone tool in the context of improving the rational parametrization…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
We introduce a new class of commutative noetherian DG-rings which generalizes the class of regular local rings. These are defined to be local DG-rings $(A,\bar{\mathfrak{m}})$ such that the maximal ideal $\bar{\mathfrak{m}} \subseteq…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
The identification of continuous-time (CT) systems from discrete-time (DT) input and output signals, i.e., the sampled data, has received considerable attention for half a century. The state-of-the-art methods are parametric methods and…
Following the work of [Dikranjan et al., Fund. Math. 249:185-209, 2020] for arithmetic sequences, very recently in [Das et al., Expo. Math. 43(3):125653, 2025], statistically characterized subgroups have been investigated for certain types…
Classical automata theory is far more capable of modeling complex digital systems than is widely acknowledged in the ``formal methods'' literature. This paper takes a second look at automata theory methods that were mostly developed in the…
In this paper, a new two-parameter family of regularized kernels is introduced, suitable for applying high-order time stepping to N-body systems. These high-order kernels are derived by truncating a Taylor expansion of the non-regularized…
The Segal algebra $\mathbf{S}_{0}(G)$ is well defined for arbitrary locally compact Abelian Hausdorff (LCA) groups $G$. It is a Banach space that exhibits a kernel theorem similar to the well-known Schwartz kernel theorem. Specifically, we…
Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…
This paper presents a novel feature of the kernel-based system identification method. We prove that the regularized kernel-based approach for the estimation of a finite impulse response is equivalent to a robust least-squares problem with a…
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
The notion of a homogeneous standard filtration of $\sigma$-algebras was introduced by the author in 1970. The main theorem asserted that a homogeneous filtration is standard, i.e., generated by a sequence of independent random variables,…
Abstract models of computation often treat the successor function $S$ on $\mathbb{N}$ as a primitive operation, even though its low-level implementations correspond to non-trivial programs operating on specific numerical representations.…
Let the sequence S_m of nonnegative integers be generated by the following conditions: Set the first term a_0 = 0, and for all k \geq 0, let a_k+1 be the least integer greater than a_k such that no element of {a_0,...,a_k+1} is the average…
In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obtain constructive linear time parameterized algorithms for…
Semi-simplicial and semi-cubical sets are commonly defined as presheaves over respectively, the semi-simplex or semi-cube category. Homotopy Type Theory then popularized an alternative definition, where the set of n-simplices or n-cubes are…
In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…
If this article, an elementary kernel-cokernel exact sequence is introduced for $A\stackrel{f}\to B\stackrel{g}\to C$. Some relative sequences and applications are dicussed. This result can simplify some proofs---the indices of Frodholm…