English
Related papers

Related papers: On a bi-lateral Adding Machine and its characteriz…

200 papers

We extend the recent classification of Hilbert schemes with two Borel-fixed points to arbitrary characteristic. We accomplish this by synthesizing Reeves' algorithm for generating strongly stable ideals with the basic properties of…

Algebraic Geometry · Mathematics 2021-08-03 Andrew P. Staal

We generalize the concept of stack one dimension higher, introducing a notion of 2-stack suitable for a trihomomorphism from a 2-category equipped with a bitopology into the tricategory of bicategories. Moreover, we give a characterization…

Category Theory · Mathematics 2024-03-14 Elena Caviglia

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

Logic · Mathematics 2023-07-10 Djamel Eddine Amir , Mathieu Hoyrup

A complete classifications, up to isomorphism, of two-dimensional associative and diassociative algebras over any basic field are given.

Rings and Algebras · Mathematics 2023-07-20 I. S. Rakhimov

We address the question of finding algebraic properties that are respectively equivalent, for a morphism between algebraic varieties over an algebraically closed field of characteristic zero, to be an homeomorphism for the Zariski topology…

Algebraic Geometry · Mathematics 2022-11-16 François Bernard , Goulwen Fichou , Jean-Philippe Monnier , Ronan Quarez

For complete metric spaces $X$ and $Y$, a description of linear biseparating maps between spaces of vector-valued Lipschitz functions defined on $X$ and $Y$ is provided. In particular it is proved that $X$ and $Y$ are bi-Lipschitz…

Functional Analysis · Mathematics 2008-07-25 Jesus Araujo , Luis Dubarbie

In this paper, we introduce a class of homeomorphisms between metric spaces, which are locally biH\"{o}lder continuous mappings. Then an embedding result between Besov spaces induced by locally biH\"{o}lder continuous mappings between…

Functional Analysis · Mathematics 2023-02-23 Manzi Huang , Xiantao Wang , Zhuang Wang , Zhihao Xu

In this paper, we study the different possibilities to add two vectors of digits of a given length $m$. Our results show that there are at least $2^{m-1}$ different additions of such vectors, while there exist only two types of addition…

Number Theory · Mathematics 2012-09-18 Peter Hellekalek

We recently introduced the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. There is a type of idempotent system, said to be symmetric. In the present paper we classify up…

Rings and Algebras · Mathematics 2020-11-03 Kazumasa Nomura , Paul Terwilliger

In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…

Group Theory · Mathematics 2019-10-28 Mohsen Aliabadia , Mano Vikash Janardhanan

In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…

Metric Geometry · Mathematics 2013-08-22 Vsevolod Salnikov

We consider a class of systems over finite alphabets, namely discrete-time systems with linear dynamics and a finite input alphabet. We formulate a notion of finite uniform bisimulation, and motivate and propose a notion of regular finite…

Optimization and Control · Mathematics 2015-10-15 Donglei Fan , Danielle C. Tarraf

In this paper we study a 2-dimensional version of Quillen's homotopy category construction. Given a category $\mathscr{A}$ and a class of morphisms $\Sigma \subset \mathscr{A}$ containing the identities, we construct a 2-category…

Category Theory · Mathematics 2023-02-28 Eduardo J. Dubuc , Jaqueline Girabel

We can define the adjacency algebra of an association scheme over arbitrary field. It is not always semisimple over a field of positive characteristic. The structures of adjacency algebras over a field of positive characteristic have not…

Combinatorics · Mathematics 2015-06-11 Osamu Shimabukuro

Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the n-th level of the hierarchy is over an…

Formal Languages and Automata Theory · Computer Science 2012-08-27 Tomáš Masopust

We propose a method that learns a discriminative yet semantic space for object categorization, where we also embed auxiliary semantic entities such as supercategories and attributes. Contrary to prior work which only utilized them as side…

Computer Vision and Pattern Recognition · Computer Science 2014-12-10 Sung Ju Hwang , Leonid Sigal

In this paper we introduce a new bifurcation in Hamiltonian systems, which we call the double flip bifurcation. The Hamiltonian depends on two parameters, one of which controls the double flip bifurcation. The result of the bifurcation is…

Dynamical Systems · Mathematics 2026-01-30 Konstantinos Efstathiou , Tobias Våge Henriksen , Sonja Hohloch

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

We give a systematic construction of epimorphisms between 2-bridge link groups. Moreover, we show that 2-bridge links having such an epimorphism between their link groups are related by a map between the ambient spaces which only have a…

Geometric Topology · Mathematics 2009-04-14 Tomotada Ohtsuki , Robert Riley , Makoto Sakuma

This paper introduces a new machine architecture for evaluating lambda expressions using the normal-order reduction, which guarantees that every lambda expression will be evaluated if the expression has its normal form and the system has…

Logic in Computer Science · Computer Science 2010-11-05 Anton Salikhmetov