English
Related papers

Related papers: A closure operator respecting the modular $j$-func…

200 papers

This paper presents an optimization approach for generating custom manipulator configurations using a proposed unconventional modular library. An end-to-end solution is presented in which the resulting optimal models of the modular…

Robotics · Computer Science 2023-05-16 Anubhav Dogra , Srikant Sekhar Padhee , Ekta Singla

We develop the machinery of boundary triplets for one-dimensional operators generated by formally self-adjoint quasi-differential expression of arbitrary order on a finite interval. The technique are then used to describe all maximal…

Functional Analysis · Mathematics 2013-04-25 Andrii Goriunov , Vladimir Mikhailets , Konstantin Pankrashkin

This work is concerned with a relationship regarding the closedness of the singular locus of a Noetherian scheme and existence of classical generators in its category of coherent sheaves, associated bounded derived category, and singularity…

Algebraic Geometry · Mathematics 2025-07-15 Souvik Dey , Pat Lank

We investigate the finitary functions from a finite product of finite fields $\prod_{j =1}^m\mathbb{F}_{q_j} = \mathbb{K}$ to a finite product of finite fields $\prod_{i =1}^n\mathbb{F}_{p_i} = \mathbb{F}$, where $|\mathbb{K}|$ and…

Rings and Algebras · Mathematics 2021-09-07 Stefano Fioravanti

We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C)…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Thomas Place , Marc Zeitoun

We prove the boundedness of a trilinear operator that is modulation invariant and which contains curvature information given by the presence of a complex exponential, adding to the small class of examples of such operators.

Classical Analysis and ODEs · Mathematics 2024-12-25 Cristina Benea , Itamar Oliveira

Complementable operators extend classical matrix decompositions, such as the Schur complement, to the setting of infinite-dimensional Hilbert spaces, thereby broadening their applicability in various mathematical and physical contexts. This…

Functional Analysis · Mathematics 2025-01-14 Sachin Manjunath Naik , P. Sam Johnson

Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…

Representation Theory · Mathematics 2010-09-07 Claus Michael Ringel

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…

Symbolic Computation · Computer Science 2013-01-24 Shaoshi Chen , Ruyong Feng , Guofeng Fu , Ziming Li

We show that the order three algebraic differential equation over ${\mathbb Q}$ satisfied by the analytic $j$-function defines a non-$\aleph_0$-categorical strongly minimal set with trivial forking geometry relative to the theory of…

Logic · Mathematics 2014-09-30 James Freitag , Thomas Scanlon

Free current operators are constructed for massive particles with arbitrary spin $j$. Such current operators are related to representations of the U(N,N) type groups and are covariant under the (extended) Poincar\'{e} group and charge…

Nuclear Theory · Physics 2009-11-07 W. H. Klink

We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…

Rings and Algebras · Mathematics 2015-08-18 Agata Pilitowska , Anna Zamojska-Dzienio

Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.

Number Theory · Mathematics 2018-10-18 Goubi Mouloud

In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure by polymorphisms of a boolean relation with a…

Computational Complexity · Computer Science 2015-09-22 Arnaud Mary , Yann Strozecki

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

Constructor-Based Conditional Rewriting Logic is a general framework for integrating first-order functional and logic programming which gives an algebraic semantics for non-deterministic functional-logic programs. In the context of this…

Logic in Computer Science · Computer Science 2007-05-23 Juan M. Molina , Ernesto Pimentel

We will investigate the norm closure of the unitary and similarity orbits of normal operators in unital, simple, purely infinite C*-algebras. An operator theoretic proof will be given to the classification of when two normal operators are…

Operator Algebras · Mathematics 2013-05-28 Paul Skoufranis

We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing "algebraic" semantics for nonclassical first-order logics. This framework includes a natural notion of substitution, which allows…

Logic · Mathematics 2023-06-05 Colin Bloomfield , Yoshihiro Maruyama

In system operations it is commonly assumed that arbitrary changes to a system can be reversed or `rolled back', when errors of judgement and procedure occur. We point out that this view is flawed and provide an alternative approach to…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-04-27 Mark Burgess , Alva Couch

We define the notion of rational closure in the context of Description Logics extended with a tipicality operator. We start from ALC+T, an extension of ALC with a typicality operator T: intuitively allowing to express concepts of the form…

Artificial Intelligence · Computer Science 2013-05-07 Laura Giordano , Valentina Gliozzi , Nicola Olivetti , Gian Luca Pozzato