Related papers: Length Function Compatibility for Group Actions on…
Across a wide range of hardware scenarios, the computational efficiency and physical size of the arithmetic units significantly influence the speed and footprint of the overall hardware system. Nevertheless, the effectiveness of prior…
In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting…
Let $\Lambda$ be an ordered abelian group, $\mathrm{Aut}^+(\Lambda)$ the group of order-preserving automorphisms of $\Lambda$, $G$ a group and $\alpha:G\to\mathrm{Aut}^+(\Lambda)$ a homomorphism. An $\alpha$-affine action of $G$ on a…
Let $(X,\tau)$ be a Polish space with Borel probability measure $\mu,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of…
It is known that recently proposed model of mimetic gravity can be presented as general relativity with an additional mimetic matter. We discuss a possibility to analogously reformulate the embedding theory, which is the geometrical…
We characterize rational actions of the additive group on algebraic varieties defined over a field of characteristic zero in terms of a suitable integrability property of their associated velocity vector fields. This extends the classical…
Regression trees and their ensemble methods are popular methods for nonparametric regression: they combine strong predictive performance with interpretable estimators. To improve their utility for locally smooth response surfaces, we study…
Among many topological indices of trees the sum of distances $\sigma(T)$ and the number of subtrees $F(T)$ have been a long standing pair of graph invariants that are well known for their negative correlation. That is, among various given…
Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…
For a locally compact second countable group G and a lattice subgroup Gamma, we give an explicit quantitative solution of the lattice point counting problem in general domains in G, provided that i) G has finite upper local dimension, and…
On the base of the distinction between covariant and contravariant metric tensor components, a new (multivariable) cubic algebraic equation for reparametrization invariance of the gravitational Lagrangian has been derived and parametrized…
This paper is a detailled study of the coding of real trees by real valued functions that is motivated by probabilistic problems related to continuum random trees. Indeed it is known since the works of Aldous (1993) and Le Gall (1991) that…
Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…
The nonsoluble length $\lambda (G)$ of a finite group $G$ is defined as the number of nonsoluble factors in a shortest normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. The generalized…
Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…
In this talk, we show how the monodromy matrix, ${\hat{\cal M}}$, can be constructed for the two dimensional tree level string effective action. The pole structure of ${\hat{\cal M}}$ is derived using its factorizability property. It is…
We target on the document-level relation extraction in an end-to-end setting, where the model needs to jointly perform mention extraction, coreference resolution (COREF) and relation extraction (RE) at once, and gets evaluated in an…
Forms are a common type of document in real life and carry rich information through textual contents and the organizational structure. To realize automatic processing of forms, word grouping and relation extraction are two fundamental and…
For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…
We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power tail asymptotics of the distributions of the solutions R to: R =_D…