English
Related papers

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

200 papers

In this paper, we define a natural metric on Aut(X*) and prove that the closure of the adding machine group, a subgroup of the automorphism group, is both isometric and isomorphic to the group of p-adic integers. So, we show that the group…

Group Theory · Mathematics 2011-01-13 Bunyamin Demir , Mustafa Saltan

An integer adder for integers in the binary representation is one of the basic operations of any digital processor. For adding two integers of N bits each, the serial adder takes as many clock ticks. For achieving higher speeds, parallel…

Hardware Architecture · Computer Science 2019-03-26 Duggirala Meher Krishna , Duggirala Ravi

The bilinear assignment problem (BAP) is a generalization of the well-known quadratic assignment problem (QAP). In this paper, we study the problem from the computational analysis point of view. Several classes of neigborhood structures are…

Data Structures and Algorithms · Computer Science 2017-09-12 Vladyslav Sokol , Ante Ćustić , Abraham P. Punnen , Binay Bhattacharya

For each countable ordinal $\alpha$, we introduce an ideal $conv_\alpha$ and use it to characterize the class of all compact countable spaces which are homeomorphic to the space $\omega^{\alpha}\cdot n+1$ with the order topology. The…

General Topology · Mathematics 2025-03-18 Rafał Filipów , Małgorzata Kowalczuk , Adam Kwela

An automorphism of a spherical building is called domestic if it maps no chamber to an opposite chamber. In this paper we classify domestic automorphisms of spherical buildings of classical type.

Group Theory · Mathematics 2023-03-15 James Parkinson , Hendrik Van Maldeghem

We show that history-preserving bisimilarity for higher-dimensional automata has a simple characterization directly in terms of higher-dimensional transitions. This implies that it is decidable for finite higher-dimensional automata. To…

Logic in Computer Science · Computer Science 2013-04-17 Uli Fahrenberg , Axel Legay

We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…

Cellular Automata and Lattice Gases · Physics 2012-08-15 Ville Salo , Ilkka Törmä

The group of continuous binary operations on a topological space is studied; its relationship with the group of homeomorphisms is established. The category of binary $G$-spaces and bi-equivariant maps is constructed, which is a natural…

General Topology · Mathematics 2023-07-13 Pavel S. Gevorgyan

For two positive maps $\phi_i:B(\mathcal{K}_i)\to B(\mathcal{H}_i)$, $i=1,2$, we construct a new linear map $\phi:B(\mathcal{H})\to B(\mathcal{K})$, where $\mathcal{K}=\mathcal{K}_1\oplus\mathcal{K}_2\oplus\mathbb{C}$,…

Operator Algebras · Mathematics 2018-02-19 Marcin Marciniak , Adam Rutkowski

Covering and elimination inequalities are central to combinatorial optimization, yet their role has largely been studied in problem-specific settings or via no-good cuts. This paper introduces a unified perspective that treats these…

Optimization and Control · Mathematics 2025-11-18 Ningji Wei

We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Rudolf Freund , Andreas Klein , Martin Kutrib

This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and…

Optimization and Control · Mathematics 2025-09-30 Justo Puerto , Jose A. Ruiz-Alba

We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…

Formal Languages and Automata Theory · Computer Science 2015-09-21 Özlem Salehi , A. C. Cem Say

We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape. Similarly as in the case of the classical two-way machines, it…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Viliam Geffert , Lubomíra Ištoňová

A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…

Rings and Algebras · Mathematics 2024-04-25 Kenji Nakahira

We describe three algorithms for generating binary-valued holograms. Our methods are optimised for producing large arrays of tightly focussed optical tweezers for trapping particles. Binary-valued holograms allow us to use a digital mirror…

Optics · Physics 2014-09-08 Dustin Stuart , Oliver Barter , Axel Kuhn

Motivated by the definition of Freiman homomorphism, we explore the possibilities of formulating some basic notions and techniques of additive combinatorics in a categorical language. We show that additive sets and Freiman homomorphisms…

Combinatorics · Mathematics 2025-02-14 Saúl A. Blanco , Esfandiar Haghverdi

We prove that a quasi-finite endomorphism of an algebraic variety over an algebraically closed field of characteristic zero, that is injective on the complement of a closed subvariety, is an automorphism. We also prove that an endomorphism…

Algebraic Geometry · Mathematics 2021-04-02 Nilkantha Das

Let k a characteristic zero field. We give a characterization for the finite quiver k-algebras, based on double derivations. More precisely, we prove that if an associative and unitary k-algebra have a family of double derivations…

Rings and Algebras · Mathematics 2008-07-09 Jorge A. Guccione , Juan J. Guccione

We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we…

Combinatorics · Mathematics 2019-06-25 Lara Pudwell , Rebecca Smith