Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on Thompso...
The differences between "denn" and "weil" are syntactic only. "Denn" introduces a main clause, which is why, as you say, it "doesn't change the sentence structure". The finite verb remains in second …
This note is devoted to some questions about the representation theory over the finite field $\mathbb{F}_2$ of the general linear groups $\mathbb{GL_n(F_2)}$ and Poincaré series of unstable modules. The first draft was describing two conjectures. Th...
Nyquist Signaling Modulations (NSMs) are a new signaling paradigm inspired by faster-than-Nyquist principles but based on a distinct approach that enables controlled inter-symbol interference through carefully designed finite-impulse-response filters...
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group structure generat...
Let $\Out(F_n)$ denote the outer automorphism group of the free group $F_n$ with $n>3$. We prove that for any finite index subgroup $Γ<\Out(F_n)$, the group $\Aut(Γ)$ is isomorphic to the normalizer of $Γ$ in $\Out(F_n)$. We prove that $Γ$ is {...
Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs $\mathcal{G}^α$, and show that $\mathcal{G}^α$ has unbounded clique-width unless $α$ contains at most finitely many non-zero letters. We als...
In this paper we study {\em terminal embeddings}, in which one is given a finite metric $(X,d_X)$ (or a graph $G=(V,E)$) and a subset $K \subseteq X$ of its points are designated as {\em terminals}. The objective is to embed the metric into a normed...
We investigate the estimation of dephasing-induced decoherence in continuous-variable quantum systems using non-Gaussian probe states. By purifying the open system, we identify optimal probes, specifically squeezed cat and symmetric squeezed compass...
A proof of the Quadratic Reciprocity Law is presented using a Lemma of Gauss, the theory of finite fields and the Frobenius automorfism....
BHs with integrable singularities (IS) have gained attention because, unlike usual regular BHs, they avoid a potentially unstable de Sitter core and the presence of an internal horizon that breaks predictability, while exhibiting finite tidal forces...
Let F be a finite field and let C be a smooth projective curve over F. For some smooth projective surfaces X over F we establish that the third unramified cohomology of the product of X and C vanishes. This applies in particular to geometrically rati...
A peacock is a family of probability measures with finite mean that increases in convex order. It is a classical result, in the discrete time case due to Strassen, that any peacock is the family of one-dimensional marginals of a martingale. We study...
We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict subset of th...
Gabber deduced his theorem of independence of $l$ of intersection cohomology from a general stability result over finite fields. In this article, we prove an analogue of this general result over local fields. More precisely, we introduce a notion o...
Let $k$ be an algebraically closed field, a finite field or a $p$-adic field. Let $K_0=k((x,y))$ be the field of Laurent series in two variables over $k$. We define Tate-Shafarevich groups of a commutative group scheme over $K_0$ via cohomology class...
In this paper we recall the concepts of $G$-odometer and $G$-subodometer for $G$-actions, where $G$ is a discrete finitely generated group, which generalize the notion of odometer in the case $G=\ZZ$. We characterize the $G$-regularly recurrent sys...
Building structures by low capability robots is a very recent research development. A robot (or a mobile agent) is designed as a deterministic finite automaton. The objective is to make a structure from a given distribution of materials (\textit{bric...
Recently, methods for learning diverse skills to generate various behaviors without external rewards have been actively studied as a form of unsupervised reinforcement learning. However, most of the existing methods learn a finite number of discrete...
Entanglement engines are autonomous quantum thermal machines designed to generate entanglement from the presence of a particle current flowing through the device. In this work, we investigate the functioning of a two-qubit entanglement engine beyond...
It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different versions of...
We study finite-time horizon continuous-time linear-convex reinforcement learning problems in an episodic setting. In this problem, the unknown linear jump-diffusion process is controlled subject to nonsmooth convex costs. We show that the associated...
In this paper, we present the concepts of the upper and lower approximations of Anti-rough subgroups, Anti-rough subsemigroups, and homeomorphisms of Anti-Rough anti-semigroups in approximation spaces. Specify the concepts of rough in Finite anti-gro...
Fuzzy anti-norm and corresponding $α$-norms are defined. A few properties of finite dimensional fuzzy anti-normed linear space are studied. Fuzzy $α$-anti-convergence and fuzzy $α$-anti-complete linear space are defined and a few of their properti...
In mathematics, the discrete exterior calculus (DEC) is the extension of the exterior calculus to discrete spaces including graphs, finite element meshes
We investigate the combinatorial structure of subspaces of the exterior algebra of a finite-dimensional real vector space, working in parallel with the extremal combinatorics of hypergraphs. Using initial monomials, projections of the underlying vect...
FEECa: Finite Element Exterior Calculus in Haskell (⭐ 34)
We study hysteresis for a two-dimensional, spin-1/2, nearest-neighbor, kinetic Ising ferromagnet in an oscillating field, using Monte Carlo simulations. The period-averaged magnetization is the order parameter for a proposed dynamic phase transitio...
Arduino Finite Impulse Response and Infinite Impulse Response filter implementations. (⭐ 131)
Main (or independent) clauses can form sentences on their own. They aren’t dependent on other clauses. They are always finite (they must contain a verb which shows tense). Subordinate (or …
A clause is comprised of a group of words that include a subject and a finite verb. It contains only one subject and one verb. The subject of a clause can be mentioned or hidden, but the verb must be …
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain basic redu...
Clauses can be classified according to a distinctive trait that is a prominent characteristic of their syntactic form. The position of the finite verb is one major trait used for classification, and the …
Let $R$ be a finite ring with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph whose vertices are pairs $(e, u)$, where $e$ is an idempotent element and $u$ is a unit of $R$. Two distinct vertices $(e, u)$ and $(f, v)$ are adjacent if and o...
Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The clean gra...
finite-state toolkit, EM and Bayesian (Gibbs sampling) training for FST and context-free derivation forests (⭐ 41)
Given a rational projective parametrization $\cP(\ttt,\sss,\vvv)$ of a rational projective surface $\cS$ we present an algorithm such that, with the exception of a finite set (maybe empty) $\cB$ of projective base points of $\cP$, decomposes the proj...
This work describes a methodology to combine logic-based systems and connectionist systems. Our approach uses finite truth valued Łukasiewicz logic, where we take advantage of fact what in this type of logics every connective can be define by a neur...
This paper presents simulations of the impact of tongue surgery on tongue movements and on speech articulation. For this, a 3D biomechanical Finite Element (FE) model of the tongue is used. Muscles are represented within the FE structure by specifi...
This is a nearly complete manuscript left behind by Boris Weisfeiler before his disappearance during a hiking trip in Chile in 1985. It is posted on a request from the author's sister, Olga Weisfeiler....