English
Related papers

Related papers: Syzygies among reduction operators

200 papers

With reference to the equivalence theorem, we discuss the selection of basis operators for effective field theories in general. The equivalence relation can be used to partition operators into equivalence classes, from which inequivalent…

High Energy Physics - Phenomenology · Physics 2013-09-24 Martin B Einhorn , José Wudka

We construct representation theory of Lie algebras with filtrations. In this framework a classification of irreducible representations is obtained and spectra of some reducible representations are found.

Representation Theory · Mathematics 2012-03-01 A. N. Panov

On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

For commuting linear operators $P_0,P_1,..., P_\ell$ we describe a range of conditions which are weaker than invertibility. When any of these conditions hold we may study the composition $P=P_0P_1... P_\ell$ in terms of the component…

Operator Algebras · Mathematics 2007-06-19 A. Rod Gover , Josef Silhan

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

Relativistic quantum systems that admit scattering experiments are quantitatively described by effective field theories, where $S$-matrix kinematics and symmetry considerations are encoded in the operator spectrum of the EFT. In this paper…

High Energy Physics - Theory · Physics 2017-11-22 Brian Henning , Xiaochuan Lu , Tom Melia , Hitoshi Murayama

This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…

Logic in Computer Science · Computer Science 2021-01-11 Carlos Olarte , Elaine Pimentel , Camilo Rocha

The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…

Logic in Computer Science · Computer Science 2021-02-25 Henry Soldano

We investigate some types of composition operators, linear and not, and conditions for some spaces to be mapped into themselves and for the operators to satisfy some good properties.

Functional Analysis · Mathematics 2020-12-08 Emma D'Aniello , Martina Maiuriello

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

Logic · Mathematics 2024-11-28 A. L. Semenov , S. F. Soprunov

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

Computer Vision and Pattern Recognition · Computer Science 2024-02-14 Anvar Kabulov , Alimdzhan Babadzhanov , Islambek Saymanov

For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…

Formal Languages and Automata Theory · Computer Science 2025-12-15 Thorsten Wißmann

The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…

High Energy Physics - Theory · Physics 2015-06-26 F. Ferrari , J. Sobczyk

In this paper we give new characterizations of Riesz and conditional Riesz frames in terms of the properties of the nullspace of their synthesis operators. On the other hand, we also study the oblique dual frames whose coefficients in the…

Functional Analysis · Mathematics 2015-06-26 Jorge Antezana , Gustavo Corach , Mariano Ruiz , Demetrio Stojanoff

Let $\mathfrak{g}$ be a vector space and $[,],[,]'$ be a pair of Lie brackets on $\mathfrak{g}$. By definition they are compatible if $[,]+[,]'$ is again a Lie bracket. Such pairs play important role in bihamiltonian and $r$-matrix…

Differential Geometry · Mathematics 2012-08-09 Andriy Panasyuk

Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of…

Programming Languages · Computer Science 2025-08-07 Luigi Liquori , Michael Mendler

We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. We provide basic tools that allow efficient protocols to be constructed in a compositional…

Logic in Computer Science · Computer Science 2021-10-26 Dexter Kozen , Matvey Soloviev

All operator algebras have (not necessarily irreducible) boundary representations. A unital operator algebra has enough such boundary representations to generate its C*-envelope.

Operator Algebras · Mathematics 2007-05-23 Michael A. Dritschel , Scott McCullough

Let $k$ be a nonperfect separably closed field. Let $G$ be a (possibly non-connected) reductive group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In our previous work, we…

Group Theory · Mathematics 2019-03-15 Tomohiro Uchiyama

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of…

Logic · Mathematics 2024-06-21 Sergiy Koshkin