Related papers: On the systematic construction of basis invariants
Nonhamiltonian interaction of hamiltonian systems is considered. Dynamical equations are constructed by use of symmetric designs on Lie algebras. The results of analysis of these equations show that some class of symmetric designs on Lie…
We propose a new method to construct a stationary process and random field with a given decreasing covariance function and any one-dimensional marginal distribution. The result is a new class of stationary processes and random fields. The…
Let $(N, J)$ be a simply connected $2n$-dimensional nilpotent Lie group endowed with an invariant complex structure. We define a left invariant Riemannian metric on $N$ compatible with $J$ to be minimal, if it minimizes the norm of the…
A Bayesian pseudocoreset is a compact synthetic dataset summarizing essential information of a large-scale dataset and thus can be used as a proxy dataset for scalable Bayesian inference. Typically, a Bayesian pseudocoreset is constructed…
The traditional Pi-theorem tells us that for any dimensionally invariant relation there exists a full set of independent dimensionless "Pi groups" which can be used to nondimensionalise the relation. In this paper, we seek to understand…
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theories. Our framework is based on the counter-example guided…
A class of three-dimensional models which satisfy supersymmetric intertwining relations with the simplest - oscillator-like - variant of shape invariance is constructed. It is proved that the models are not amenable to conventional…
We use classical invariant theory to construct invariants of complex graded Gorenstein algebras of finite vector space dimension. As a consequence, we obtain a way of extracting certain numerical invariants of quasi-homogeneous isolated…
A basis of Lorentz and gauge-invariant monomials in non--Abelian gauge theories with matter is described, applicable for the inverse mass expansion of effective actions. An algorithm to convert an arbitrarily given invariant expression into…
Transformer architectures are typically described in algorithmic and statistical terms, leaving their internal mechanics without a familiar structural language for researchers trained in physical theories. To bridge this gap, we develop a…
We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…
Invariants are a set of properties over program attributes that are expected to be true during the execution of a program. Since developing those invariants manually can be costly and challenging, there are a myriad of approaches that…
We introduce a novel Bayesian approach for both covariate selection and sparse precision matrix estimation in the context of high-dimensional Gaussian graphical models involving multiple responses. Our approach provides a sparse estimation…
In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…
We construct families of birational involutions on $\mathbb{P}^3$ or a smooth cubic threefold which do not fit into a non-trivial elementary relation of Sarkisov links. As a consequence, we construct new homomorphisms from their group of…
We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…
An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real…
An algorithm for automated construction of a sparse Bayesian network given an unstructured probabilistic model and causal domain information from an expert has been developed and implemented. The goal is to obtain a network that explicitly…
We provide simple schemes to build Bayesian Neural Networks (BNNs), block by block, inspired by a recent idea of computation skeletons. We show how by adjusting the types of blocks that are used within the computation skeleton, we can…
The radically synthetic foundation for smooth geometry formulated in [Law11] postulates a space T with the property that it has a unique point and, out of the monoid T^T of endomorphisms, it extracts a submonoid R which, in many cases, is…