Defines ternary group homology for knot theory applications.
problem Understanding ternary groups and their homology.
method Developed a homology theory for ternary groups using associativity and skew elements.
result Discussed applications of ternary knot groups.
Ternary groups from knot theory help classify curves.
problem Characterizing ternary groups with knot theory axioms.
method Using semi-commutativity and Reidemeister moves.
result Constructs a curve invariant under Reidemeister moves.
The paper extends ternary algebra concepts using cube roots of unity.
problem Extending algebraic structures from binary to ternary multiplication.
method Introducing ternary associator, commutator, and Lie algebra at cube roots of unity.
result Derived an identity for ternary commutator based on GA(1,5). New cohomology theories for heaps and ternary operations linked to group cohomology.
problem Defining and studying cohomology theories for heaps and ternary operations.
method Introduced para-associative and heap cohomology theories, and ternary self-distributive cohomology with abelian heap coefficients.
result Heap cohomology is related to group cohomology via a long exact sequence, and injects into ternary self-distributive cohomology.
Introduces Lie semiheaps and their relation to Lie groups and bundles.
problem Defining and understanding Lie semiheaps and their properties.
method Introducing Lie semiheaps and proving their properties in relation to Lie groups and bundles.
result Established the existence of left-invariant vector fields on Lie semiheaps.
We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains the relations from the knot group, and from the core group. Using the ternary o…
We introduce a notion of ternary distributive algebraic structure, give examples, and relate it to the notion of a quandle. Classification is given for low order structures of this type. Constructions of such structures from ternary bialgebras are provided. We also describe ternary distributive algebraic structures com…
The group of C1-diffeomorphisms of any sparse Cantor subset of a manifold is countable and discrete (possibly trivial). Thompson's groups come out of this construction when we consider central ternary Cantor subsets of an interval. Brin's higher dimensional generalizations nV of Thompson's group V arise…
The paper constructs new algebraic structures from Lie algebras and ternary Nambu-Lie algebras, leading to Yang-Baxter operators.
problem Constructing new algebraic structures from Lie algebras and ternary Nambu-Lie algebras.
method Using compositions of binary Lie algebras, 3-Lie algebras, and ternary Nambu-Lie algebras, the paper constructs ternary self-distributive objects and Yang-Baxter operators.
result The constructed Yang-Baxter operators are not gauge equivalent to the transposition operator and can be deformed to new solutions.
New knot coloring layers simplify homology calculations.
problem Complex knot homology calculations.
method Inductive ternary quasigroup colorings and higher degree homology.
result More efficient homology group access.
Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.
problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.
Characterizes knot-theoretic flocks up to 64 elements.
problem Classifying ternary quasigroups for knot theory.
method Group action on flock colorings to improve knot-theoretic invariant.
result Enumerated and characterized knot-theoretic flocks up to 64 elements.
Heap theory applied to framed links yields new invariants.
problem Developing invariants for framed links using heap theory.
method Introducing fundamental heap, defining cocycle invariant using ternary cohomology.
result Found cocycles and computed invariants for specific link families.
Lectures explore how differential methods improve understanding of algebraic group orbit spaces.
problem Understanding structure of invariants and orbit spaces of algebraic Lie groups.
method Combines algebraic and differential viewpoints to study orbit spaces.
result Differential approach provides deeper insights into invariants and orbit spaces.
Novel ternary structures reveal new interpretations of linear connections.
problem Examining the ternary structure of Lie algebroid connections.
method Study of endomorphisms and explicit presentation of the endomorphism truss.
result Explicitly presented endomorphism truss of linear connections.
New invariants derived from ternary quasigroups for knot theory.
problem Developing invariants for knot theory using ternary quasigroups.
method Defined subcomplexes and cocycle invariants based on normalized homology.
result Cocycle invariants defined for ternary quasigroups satisfying specific conditions.
We define homology of ternary algebras satisfying axioms derived from particle scattering or, equivalently, from the third Reidemeister move. We show that ternary quasigroups satisfying these axioms appear naturally in invariants of Reidemeister, Yoshikawa, and Roseman moves. Our homology has a degenerate subcomplex. T…
Binary and ternary weights simplify RNNs for mobile devices.
problem Complexity and memory intensity of RNNs on mobile devices.
method Learn binary and ternary weights during training.
result Significant memory saving and inference speedup on ASIC platform.
Ternary MobileNets improve efficiency and accuracy on constrained devices.
problem Efficiently compressing MobileNets for real-time applications on constrained devices.
method Per-layer hybrid filter banks for ternary quantization of MobileNets.
result 27.98% energy savings and 51.07% reduction in model size with comparable accuracy.
Smart Quantization adapts binary and ternary quantization for neural networks.
problem Resource constraints in deploying neural networks on devices with limited resources.
method Adaptive combination of binary and ternary quantization with a regularization function.
result Adapts quantization depth during training to maintain high model accuracy.
New algebraic structure for vector bundles with special properties.
problem Developing new algebraic structures for vector bundles.
method Introducing para-associative algebroids and showing local triviality conditions.
result Existence of a differential connection is necessary and sufficient for local triviality.
Deep learning produces efficient ternary projections for image compression.
problem Efficiently compress and reconstruct sparse signals from incomplete measurements.
method End-to-end deep learning architecture for learning projection matrices and reconstruction operators.
result Deep learning approach yields more efficient ternary projections compared to state-of-the-art methods.
In this paper are given explicit calculations of Laplace operator spectrum for smooth real/complex-valued functions on all connected compact simple rank three Lie groups with biinvariant Riemannian metric and established a connection of obtained formulas with the number theory and integer ternary and binary quadratic f…
EC2T creates sparse and ternary neural networks for resource-constrained devices.
problem Deploying deep neural networks on resource-constrained devices.
method Entropy-Constrained Trained Ternarization (EC2T) framework.
result EC2T creates sparse and ternary neural networks that are efficient in terms of storage and computation.
The paper is based on relations between a ternary symmetric form defining the SO(3) geometry in dimension five and Cartan's works on isoparametric hypersurfaces in spheres. As observed by Bryant such a ternary form exists only in dimensions n_k=3k+2, where k=1,2,4,8. In these dimensions it reduces the orthogonal group …
In this article, we study the smooth mapping class group of a surface S relative to a given Cantor set, that is the group of isotopy classes of orientation-preserving smooth diffeomorphisms of S which preserve this Cantor set. When the Cantor set is the standard ternary Cantor set, we prove that the subgroup consisting…
Unified cosmological and Einstein polytope theories.
problem Unified understanding of cosmological and Einstein polytope theories.
method Unified combinatorial perspective of cosmological and Einstein polytope theories.
result Unified construction of cosmological and Einstein polytope theories.
We prove that the quotients of the group algebra of the braid group introduced by L. Funar in Comm. Math. Phys., 1995, collapses in characteristic distinct from 2. In characteristic 2 we define several quotients of it, which are connected to the classical Hecke and Birman-Wenzl-Murakami quotients, but which admit in ad…
New method trains neural networks with binary or ternary weights efficiently.
problem Training high-precision, real-time neural networks on limited hardware.
method Local reparameterization trick modification for discrete weights.
result State-of-the-art results on binary and ternary models on various benchmarks.
Quantum invariant derived from ternary cohomology of self-distributive structures.
problem Defining and proving a quantum invariant from ternary cohomology.
method Constructing a ribbon category from a TSD set, showing it coincides with the cocycle invariant.
result The ribbon cocycle invariant is a quantum invariant.
New braided Frobenius algebras created from specific Hopf algebras.
problem Creating new algebraic structures from Hopf algebras.
method Heap operation and Yang-Baxter operator on tensor product.
result Heap operation induces a braiding compatible with Frobenius operations.
New inequality for ternary variables improves on existing measures.
problem Analyzing excess losses and weighted majority votes with ternary random variables.
method Developed a split-kl inequality and its PAC-Bayes extension.
result Outperforms existing inequalities in certain regimes.
Paper ranks stocks by compression risk, not volatility.
problem Investment risk not correlated with stock price volatility.
method Binary-ternary compressive coding of price change time series.
result Compression risk is a better indicator of stock investment risk.
Algorithm identifies Copeland winners in dueling bandits with ternary feedback.
problem Identifying Copeland winners in dueling bandits with indifferences.
method Proposed POCOWISTA algorithm with a sample complexity close to lower bound.
result Algorithm shows excellent performance, even for conventional dueling bandits.
Selective classification improves trading strategies by abstaining from predictions.
problem Designing effective trading strategies using selective classification.
method Extends binary or multi-class classifiers to allow abstaining from predictions, evaluates across different feature sets and classifiers.
result Selective classifiers can improve trading performance by avoiding poor predictions.
Motivated by large-scale Collaborative-Filtering applications, we present a Non-Commuting Latent Factor (NCLF) tensor-completion approach for modeling three-way arrays, which is diagonal like the standard PARAFAC, but wherein different terms distinguish different kinds of three-way relations of co-clusters, as determin…
Study examines null vector fields on Lorentzian manifolds.
problem Understanding the structure of null vector fields on Lorentzian manifolds.
method Investigates the bundle structure and ternary product of nowhere vanishing null vector fields.
result Null tangent bundle is a non-polynomial graded bundle with a para-associative ternary product.
FTTQ optimizes quantized networks in federated learning, reducing communication costs.
problem Redundant parameters in full-precision models lead to excessive communication costs in federated learning.
method FTTQ algorithm that optimizes quantized networks on clients through self-learning quantization factors.
result FTTQ reduces communication costs and can achieve slightly better performance on non-IID data.
Study curvature loci of 3-manifolds in R^6 and R^5.
problem Characterize curvature loci of 3-manifolds in different dimensions.
method Refine affine classification of real nets of quadrics, study singularities, and analyze systems of ternary cubics.
result Obtain generic curvature loci and singularities of 3-manifolds.
We consider the nonstandard inclusion of SO(3) in SO(5) associated with a 5-dimensional irreducible representation. The tensor Υ representing this reduction is found to be given by a ternary symmetric form with special properties. A 5-dimensional manifold (M,g,Υ) with Riemannian metric g and ternary form generate…
New method optimizes weights and quantizers in ternary neural networks.
problem Reducing model size and computational cost in deep neural networks.
method Simultaneous optimization of weights and quantizers using truncated Gaussian approximation.
result 3.9-2.16% accuracy loss in ImageNet classification tasks.
GOCPD detects change points by maximizing the probability of two independent models.
problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.
GTC improves neural network compression and accuracy without multiplications.
problem Balancing accuracy and computational complexity in deep neural networks.
method Generalizes ternary connect to allow arbitrary levels and integer powers of two, learning optimal levels and weights end-to-end.
result GTC achieves comparable accuracy to binary networks with superior compression and hardware benefits.
TRF uses ternary random features to improve ML performance without extra computation.
problem Improving ML performance with less computation and storage.
method Proposes Ternary Random Features (TRF) for random features compression.
result TRF asymptotically yields the same limiting kernel as original matrices, with improved efficiency.
Paper addresses data reconstruction from privacy-protected templates using STCA.
problem Reconstructing privacy-sensitive data from protected templates.
method Sparse ternary coding with ambiguization (STCA) for privacy preservation.
result STCA maintains theoretical performance against deep reconstruction attacks for synthetic data but requires special measures for real images.
Proposes volumization for neural networks to control bias-variance tradeoff.
problem Improving generalization and preventing memorization in neural networks.
method Defines a physical volume for weights, interpolating between L2 and L∞ regularization.
result Volumization interpolates between weight decay and clipping, improving generalization.
This paper introduces Hausdorff measure and its applications in fractal geometry.
problem Defining and applying Hausdorff measure to fractal geometry.
method Definition of Hausdorff outer measure, Caratheodory's criterion, construction of Hausdorff measure, and introduction of Hausdorff dimension.
result Demonstrates the Hausdorff dimension of the Cantor ternary set.
Hybrid neural-tree networks reduce IoT model size and computation by 52.2% and 11.1% respectively.
problem Power and storage constraints in IoT devices limit the deployment of modern neural networks.
method Combines neural and tree-based learning with ternary quantization.
result Significant reduction in model size and computation with minimal accuracy loss.