English
Related papers

Related papers: Unitals with many involutory translations

200 papers

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

Logic in Computer Science · Computer Science 2018-09-11 Jakub Michaliszyn

It is known that the Hermitian varieties are codewords in the code defined by the points and hyperplanes of the projective spaces $PG(r,q^2)$. In finite geometry, also quasi-Hermitian varieties are defined. These are sets of points of…

Combinatorics · Mathematics 2017-06-22 A. Aguglia , D. Bartoli , L. Storme , Zs. Weiner

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…

Algebraic Geometry · Mathematics 2019-03-04 Dima Grigoriev

Being chosen as a differential operator of a special form, metric $\eta$ operator becomes unitary equivalent to a one-dimensional Hermitian Hamiltonian with a natural supersymmetric structure. We show that fixing the superpartner of this…

Mathematical Physics · Physics 2015-06-05 Boris F. Samsonov

A pair of Hermitian operators is canonical if they satisfy the canonical commutation relation. It has been believed that no such canonical pair exists in finite-dimensional Hilbert space. Here, we obtain canonical pairs by noting that the…

Quantum Physics · Physics 2026-02-25 Ralph Adrian E. Farrales , Eric A. Galapon

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

Commutative Algebra · Mathematics 2018-04-18 H. W. Lenstra, , A. Silverberg

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

Hermitian tensors are generalizations of Hermitian matrices, but they have very different properties. Every complex Hermitian tensor is a sum of complex Hermitian rank-1 tensors. However, this is not true for the real case. We study basic…

Numerical Analysis · Mathematics 2020-04-29 Jiawang Nie , Zi Yang

We give an explicit formulae for obtaining the translation symmetries in the cartesian product $X^N$, where $N$ is some positive integer and $X$ is some finite set. Moreover, we obtain some fundamental results from elementary number theory.

Number Theory · Mathematics 2025-01-03 Sourav Koner , Sreetamo Roy

The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…

Quantum Algebra · Mathematics 2007-10-18 Frédéric Chapoton , Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

Logic · Mathematics 2016-09-13 André Nies , Andrea Sorbi

The operational calculus associated with special polynomials has proven to be a powerful tool for analyzing and simplifying their properties. This article examines the bivariate degenerate Hermite polynomials with a focus on their…

Classical Analysis and ODEs · Mathematics 2025-09-01 Nusrat Raza , Ujair Ahmad , Subuhi Khan

This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…

Classical Analysis and ODEs · Mathematics 2018-03-09 Silvia Licciardi

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…

Logic in Computer Science · Computer Science 2013-12-20 Mélanie Boudard , Olivier Hermant

In this paper, we introduce a generalized piecewise translation map on the Euclidean space. We provide a special case when this map is always of finite type. For a finite type map in this case, we form conjectures on the semi-continuity of…

Dynamical Systems · Mathematics 2017-08-22 Sang Truong

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

Let F be a totally real field and p a rational prime unramified in F. We prove a partial classicality theorem for overconvergent Hilbert modular forms: when the slope is small compared to certain but not all weights, an overconvergent form…

Number Theory · Mathematics 2022-05-31 Chi-Yun Hsu

The classical soliton solution, quantized by means of suitable translational and rotational collective coordinates, is embedded into the one-particle irreductible representation of the Poincare group corresponding to a definite spin. It is…

High Energy Physics - Theory · Physics 2009-10-28 A. Dubikovsky , K. Sveshnikov

There are several notions of the 'dual' of a word/tile substitution. We show that the most common ones are equivalent for substitutions in dimension one, where we restrict ourselves to the case of two letters/tiles. Furthermore, we obtain…

Combinatorics · Mathematics 2012-01-11 Valérie Berthé , Dirk Frettlöh , Victor Sirvent

Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view,…

Discrete Mathematics · Computer Science 2009-02-11 Nathalie Aubrun , Mathieu Sablik
‹ Prev 1 3 4 5 6 7 10 Next ›