English
Related papers

Related papers: Unique Normal Forms in Infinitary Weakly Orthogona…

200 papers

We consider a field $f \circ T_1^{i_1} \circ \cdots \circ T_d^{i_d}$ where $T_1, \dots , T_d$ arecommuting transformations, one of them at least being ergodic. Considering the case of commuting filtrations, we are interested by giving…

Probability · Mathematics 2025-03-27 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

We investigate algebraic properties of weakly commutative triples, appearing in the theory of integrable nonlinear partial differential equations. Algebraic technique of skew fields of formal pseudodifferential operators as well as skew Ore…

Exactly Solvable and Integrable Systems · Physics 2017-10-27 Sergey P. Tsarev , Vitaly A. Stepanenko

We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…

Logic · Mathematics 2012-03-29 Christian Pech , Maja Pech

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

Logic in Computer Science · Computer Science 2014-05-28 Jürgen Christ , Jochen Hoenicke

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating…

Logic in Computer Science · Computer Science 2015-07-01 Takahito Aoto , Yoshihito Toyama

We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…

Category Theory · Mathematics 2018-07-10 Simon Henry

We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…

Dynamical Systems · Mathematics 2016-06-22 Peter Haïssinsky , Kevin M. Pilgrim

Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…

Logic · Mathematics 2024-12-23 Sam Sanders

This paper continues the investigation begun in arXiv:1906.05602 of extending the T1 theorem of David and Journ\'e, and optimal cancellation conditions, to more general weight pairs. The main additional tool developed here is a two weight…

Classical Analysis and ODEs · Mathematics 2019-10-24 Eric T. Sawyer

The (.)_reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)_reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget , Stuart W. Margolis

The theory of regular model sets is highly developed, but does not cover examples such as the visible lattice points, the k-th power-free integers, or related systems. They belong to the class of weak model sets, where the window may have a…

Dynamical Systems · Mathematics 2022-11-29 Michael Baake , Christian Huck , Nicolae Strungaru

We study Krasnoselskii-Mann style iterative algorithms for approximating fixpoints of asymptotically weakly contractive mappings, with a focus on providing generalised convergence proofs along with explicit rates of convergence. More…

Functional Analysis · Mathematics 2021-04-30 Thomas Powell , Franziskus Wiesnet

Let A be a commutative ring, and let \a = \frak{a} be a finitely generated ideal in it. It is known that a necessary and sufficient condition for the derived \a-torsion and \a-adic completion functors to be nicely behaved is the weak…

Rings and Algebras · Mathematics 2018-08-08 Rishi Vyas , Amnon Yekutieli

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Functional Analysis · Mathematics 2014-03-14 Ibrahim Karahan , Murat Ozdemir

This paper proves several weak limit theorems for the joint version of extreme order statistics and partial sums of independently and identically distributed random variables. The results are also extended to almost sure limit version.

Probability · Mathematics 2023-12-18 Gaoyu Li , Zhongquan Tan

Borger's theory of $\Lambda$-spaces imbues algebraic spaces, which include schemes, with an additional structure defined by an extension of the Witt vector functor. Motivated by $\mathbb{F}_1$-geometry, we prove the existence of a weak…

Algebraic Geometry · Mathematics 2025-05-08 Kai Machida

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…

Logic in Computer Science · Computer Science 2021-11-15 Paul Krogmeier , P. Madhusudan

We demonstrate a measure theoretical approach to the local regularity of weak supersolutions to elliptic and parabolic equations in divergence form. In the first part, we show that weak supersolutions become lower semicontinuous after…

Analysis of PDEs · Mathematics 2021-01-20 Naian Liao

In this survey article we outline the history of the twin theories of weak normality and seminormality for commutative rings and algebraic varieties with an emphasis on the recent developments in these theories over the past fifteen years.…

Commutative Algebra · Mathematics 2009-06-19 Marie A. Vitulli

An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of…

Formal Languages and Automata Theory · Computer Science 2013-11-25 Naoki Nishida , Masahiko Sakai , Yasuhiro Nakano
‹ Prev 1 4 5 6 7 8 10 Next ›