Related papers: Tight embedding of modular lattices into partition…
Task embedding, a meta-learning technique that captures task-specific information, has gained popularity, especially in areas such as multi-task learning, model editing, and interpretability. However, it faces challenges with the emergence…
A modification of the implicit algorithm for particle-in-cell simulations proposed by Petrov and Davis [2011] is presented. The original lattice arrangement is not inherently divergence-free, possibly leading to unphysical results. This…
The paper contains a development of the previously proposed generalized lattice model (GLM). In contrast to usual lattice models, the difference of the specific atomic volumes of the components is taken in account in GLM. In addition to…
We generate and study an ensemble of isostatic jammed hard-sphere lattices. These lattices are obtained by compression of a periodic system with an adaptive unit cell containing a single sphere until the point of mechanical stability. We…
Many innovative applications require establishing correspondences among 3D geometric objects. However, the countless possible deformations of smooth surfaces make shape matching a challenging task. Finding an embedding to represent the…
Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…
This paper supplies additions to our paper in Linear Algebra Appl. 510 (2016) 395--420 on integral spans of tight frames in Euclidean spaces. In that previous paper, we considered the case of an equiangular tight frame (ETF), proving that…
Density matrix embedding theory (Phys. Rev. Lett. 109, 186404 (2012)) and density embedding theory ((Phys. Rev. B 89, 035140 (2014)) have recently been introduced for model lattice Hamiltonians and molecular systems. In the present work,…
Recent methods for learning vector space representations of words have succeeded in capturing fine-grained semantic and syntactic regularities using vector arithmetic. However, these vector space representations (created through large-scale…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
A long-term research proposal on the algebraic structure, the representations and the possible applications of paraparticle algebras is structured in three modules: The first part stems from an attempt to classify the inequivalent gradings…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…
We prove tight probabilistic bounds for the shortest vectors in module lattices over number fields using the results of arXiv:2308.15275. Moreover, establishing asymptotic formulae for counts of fixed rank matrices with algebraic integer…
The goal of this paper is to learn dense 3D shape correspondence for topology-varying objects in an unsupervised manner. Conventional implicit functions estimate the occupancy of a 3D point given a shape latent code. Instead, our novel…
We introduce the notion of tight homomorphism into a locally compact group with nonvanishing bounded cohomology and study these homomorphisms in detail when the target is a Lie group of Hermitian type. Tight homomorphisms between Lie groups…
A fundamental issue in machine learning is the robustness of the model with respect to changes in the input. In natural language processing, models typically contain a first embedding layer, transforming a sequence of tokens into vector…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
By using a lattice characterization of continuous projections defined on a topological vector space E arising from a dual pair, we determine the automorphism group of their orthomodular poset Proj(E) by means of automorphisms and…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…