Researchers derive exclusive Racah matrix for complex representation with non-trivial multiplicities.
problem Constructing and understanding Racah matrices for complex representations with non-trivial multiplicities.
method Using effective field theory for arborescent knots, they deduced the exclusive Racah matrix for representation R=[3,1] with non-trivial multiplicities. result The exclusive Racah matrix $ar S$ for representation R=[3,1] is operator valued and depends on basis choices in intertwiner spaces. Study reveals hidden structure behind Racah matrices for twisted knots.
problem Understanding non-associativity in representation products of twisted knots.
method Analysis of quantum R-matrices and their eigenvalues to decompose Racah matrices.
result Discovery of pentad structure (Tˉ,Sˉ,S,E,B) associated with universal R-matrix. New formula simplifies evolution of twist knots and calculates Racah matrices for rectangular representations.
problem Simplifying evolution of twist knots and calculating Racah matrices for rectangular representations.
method Developed a universal formula for triangular evolution matrix B applicable to rectangular representations R=[rs]. Used skew characters and Macdonald polynomials. result Explicit knowledge of twist-family evolution leads to a nearly explicit answer for Racah matrix Sˉ in arbitrary rectangular representation R. Method extends factorization to non-rectangular representations, revealing part of the Racah matrix.
problem Factorization of HOMFLY-PT polynomials for non-rectangular representations.
method Extending the differential expansion factorization from rectangular to non-rectangular representations.
result Extracted part of the Racah matrix for non-rectangular representations.
New method extracts Racah matrices from antiparallel double-braid knots.
problem Extract exclusive Racah matrices for arborescent knots.
method Factorization of differential expansion for antiparallel double-braids.
result Found a way to reduce problem to twist knots and provide answers for R=[33]. The paper calculates Racah matrices for up to 3 strands of knots and links.
problem Systematic description of colored knot and link invariants.
method Highest weight method and use of Racah matrices.
result Explicit answers for Racah matrices and colored polynomials for 3-strand knots and links.
New findings on knot polynomials for specific representations.
problem Understanding HOMFLY polynomials for twist knots and their representations.
method Differential expansion of HOMFLY polynomials for twist knots and analysis of Racah matrices.
result Deviation of a specific coefficient from skew dimension in R=[333] representation.
New method extracts Racah matrices revealing hidden integrability in knot evolution.
problem Understanding hidden integrability in knot evolution.
method Evolution method to extract Racah matrices from 3-strand mixing matrices.
result Reveals unexpected integrability in the evolution of knots.
Quantum Racah matrices for R=[2,2] are fully described and evaluated.
problem Calculating Racah matrices for quantum groups U_q(sl_N).
method Eigenvalue hypothesis for most matrices, highest weight method for degenerate cases.
result Complete Racah matrices for |R| ≤ 4, allowing calculation of HOMFLY polynomials.
Paper calculates Racah matrices for 3-strand knots, validating conjectures.
problem Systematic description of colored knot polynomials.
method Highest weight method with Gelfand-Tseitlin tables.
result Explicit Racah matrices and polynomials for 3-strand knots up to 10 crossings.
KNTZ trick simplifies knot polynomial calculations for twist knots.
problem Completing the structure of differential expansion for twist knots.
method Converting arborescent evolution matrix into triangular form.
result Conjecture for triangular matrix B in non-rectangular case. Unified description of adjoint knot polynomials for various knots.
problem Describing adjoint knot polynomials for different types of knots.
method Developing a universal form for quantum dimensions and Racah matrices, extending the eigenvalue conjecture.
result Unified description of adjoint knot polynomials for all arborescent knots.
The paper calculates HOMFLY polynomials for 3-strand knots using a new method.
problem Systematic description of colored knot polynomials for arbitrary representations.
method Efficient highest-weight method to find inclusive Racah matrices.
result Explicitly found HOMFLY polynomials for 3-strand knots and confirmed conjectures.
The paper calculates R and Racah matrices for SO(5) and finds Kauffman polynomials.
problem Generalizing Reshetikhin-Turaev approach to SO(2n+1) case.
method Provided R and Racah matrices for SO(5) symmetric representation.
result Found Kauffman polynomials for SO(5) symmetric representation.
A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich (g+1)-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed through the Racah matrix of U_q(SU_N), and looks related to a modular transformatio…
Factorization of DE coefficients is violated in antiparallel triple pretzels, but described elegantly.
problem Understanding the origins of factorization in double braids and its extension to antiparallel triple pretzels.
method Defect-preserving deformation from trefoil to antiparallel triple pretzels, analysis of DE coefficients.
result Factorization of DE coefficients is violated but described by an elegant formula for symmetric representations.
The paper tabulates knot polynomials for a specific class of knots.
problem Computing knot polynomials for arborescent knots efficiently.
method Family approach and Feynman diagram technique with auxiliary matrix model field theory.
result New tables of colored knot polynomials for arborescent knots.
Basing on evaluation of the Racah coefficients for SU_q(3) (which supported the earlier conjecture of their universal form) we derive explicit formulas for all the 5-, 6- and 7-strand Wilson averages in the fundamental representation of arbitrary SU(N) group (the HOMFLY polynomials). As an application, we list the answ…
Character expansion expresses extended HOMFLY polynomials through traces of products of finite dimensional R- and Racah mixing matrices. We conjecture that the mixing matrices are expressed entirely in terms of the eigenvalues of the corresponding R-matrices. Even a weaker (and, perhaps, more reliable) version of this …
New method for calculating colored HOMFLY-PT polynomials for links with different symmetric representations.
problem Calculating colored HOMFLY-PT polynomials for links with arbitrary symmetric representations.
method Using quantum Racah coefficients (6j-symbols) of Uq(sl2) to simplify the evaluation. result Multi-colored link polynomials H[r1],[r2] for a specific link L7a3 are successfully evaluated. With the help of the evolution method we calculate all HOMFLY polynomials in all symmetric representations [r] for a huge family of (generalized) pretzel links, which are made from g+1 two strand braids, parallel or antiparallel, and depend on g+1 integer numbers. We demonstrate that they possess a pronounced new struc…
The paper studies colored knot polynomials focusing on representation [2,1].
problem Systematic description of colored knot polynomials.
method Parametrization of knot families, evaluation of mixing matrices, tabulation of results.
result Evaluation of knots from a 7-parametric family with up to 10 intersections.
The Nystrom method is an efficient technique used to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by working exclusively with a subset of its columns. In this work we relate this as…
New framework improves efficiency in low-rank matrix bandit problems.
problem Stochastic contextual low-rank matrix bandit problem with unknown rank matrices.
method G-ESTT and G-ESTS frameworks using Stein's method and regularization.
result Achieved improved regret bounds for low-rank matrix bandit problems.
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.
This paper optimizes exclusive sparsity norm minimization with random groupings.
problem Sparse feature selection with even distribution across groups.
method Developed efficient algorithms for exclusive sparsity norm minimization with smooth and non-smooth losses, and proposed random grouping scheme for unknown group information.
result Achieved optimal convergence rate for exclusive sparsity norm minimization.
Study on estimating covariance and precision matrices along specific subspaces.
problem Estimating covariance and precision matrices along prescribed subspaces or directions.
method Analysis of finite sample covariance, focusing on components corresponding to desired subspaces or directions.
result Estimation accuracy depends almost exclusively on components corresponding to desired subspaces or directions.
Research quantifies financial exclusion risks in UK, focusing on cash infrastructure and socio-economic factors.
problem Localised financial exclusion in the UK as cash infrastructure declines.
method Developed a composite indicator using various input variables.
result Financial exclusion is more prevalent in deprived communities and affluent areas.
The paper shows how particle movement on a manifold's grid approximates Brownian motion and heat diffusion.
problem Understanding particle movement on curved spaces.
method Analyzing symmetric exclusion process on random grids approximating a Riemannian manifold.
result Empirical density field converges to heat equation solution on the manifold.
Introduces joint exclusivity (JE), a new form of negative dependence.
problem Negative dependence structures in probability distributions.
method Defines JE by exclusion of the interior of the non-negative orthant, establishes necessary and sufficient conditions for existence, proposes a canonical construction.
result Sharp necessary and sufficient condition for existence of JE random vectors with prescribed marginals.
Extends conformal prediction to contrastive learning for better coverage of positive samples.
problem Lack of principled guarantees on coverage in contrastive learning.
method Introduces minimum-volume covering sets with learnable constraints.
result Improves inclusion-exclusion trade-offs in positive and negative samples.
Lazy SPCA simplifies SPCA for large datasets with similar performance.
problem Efficiently reducing high-dimensional datasets for large-scale computations.
method Derives a simplified algorithm (Lazy SPCA) with reduced computational complexity.
result Lazy SPCA finds the same principal subspace as SPCA and maintains similar pairwise distances.
Improves unsupervised feature learning with an exclusivity concept.
problem Overfitting in AE-based unsupervised feature learning.
method Integrates exclusivity concept to enhance AE's latent feature representation.
result Significant improvement in performance compared to other methods.
Model predicts firms likely to be added to investment exclusion lists.
problem Identifying firms likely to be added to investment exclusion lists.
method Constructed a heterogeneous information network from curated and open datasets.
result Predictive accuracy improved substantially using the network.
Proposes mutual exclusivity loss for semi-supervised deep learning.
problem Improving object recognition with unlabeled data.
method Introduces an unsupervised regularization term to force mutually-exclusive predictions.
result Improves ConvNet object recognition performance using unlabeled data.
Exclusive Group Lasso improves feature selection in correlated biological data.
problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.
Exclusive Lasso improves survival prediction in cancer datasets.
problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.
Exclusive row biclustering for gene expression data.
problem Identifying groups of cancer patients with unique types of cancer.
method Combination of biclustering algorithms and combinatorial auction techniques.
result Identification of large span non-overlapping row submatrices.
New method selects variables in groups with few nonzeros, improving support recovery.
problem Structured variable selection with sparse patterns across groups.
method Composite norm and proximal algorithm for exclusive group sparsity.
result Asymptotic consistency in signed support recovery under conventional assumptions.
The paper proposes a model to learn disentangled representations using mutual information.
problem Learning disentangled representations from shared and exclusive attributes.
method Mutual information maximization for shared attributes and minimization for disentanglement.
result The proposed model outperforms state-of-the-art models in representation disentanglement.
Paper analyzes VI for location-scale families, proving robustness guarantees for mean and correlation recovery.
problem Misspecification in VI for intractable target densities.
method Variational inference on location-scale families with symmetries.
result VI recovers mean and correlation matrix under specific symmetries.
ETM identifies field-specific keywords in text classification.
problem Unsupervised text classification with field-specific keywords.
method Weighted Lasso penalty and pairwise Kullback-Leibler divergence penalty for topic separation.
result ETM improves topic coherence by 22% and 10% compared to LDA.
An exclusion particle model is considered as a highly simplified model of a limit order market. Its price behavior reproduces the well known crossover from over-diffusion (Hurst exponent H>1/2) to diffusion (H=1/2) when the time horizon is increased, provided that orders are allowed to be canceled. For early times a ma…
AVAE improves semi-supervised learning by generating exclusive latent codes.
problem Inadequate exclusive latent codes in traditional VAE for robust classification.
method AVAE++ generates exclusive latent codes using a combination of VAE and GAN.
result AVAE outperforms state-of-the-art models in semisupervised classification.
Nonlinear RNNs' memory capacity varies widely, making it impractical.
problem The usefulness of memory capacity as a metric for linear RNNs is questioned.
method Analysis of random nonlinear RNNs with varying input scales.
result Memory capacity of nonlinear RNNs is arbitrary and impractical.
After defining cohomologically higher order BRST and anti-BRST operators for a compact simple algebra {\cal G}, the associated higher order Laplacians are introduced and the corresponding supersymmetry algebra Σ is analysed. These operators act on the states generated by a set of fermionic ghost fields transforming u…
The memory capacity of linear echo state networks is accurately calculated using new numerical methods.
problem Numerical evaluations of memory capacity in recurrent neural networks often contradict theoretical bounds.
method Developed robust numerical approaches exploiting MC neutrality with respect to the input mask matrix.
result Memory curves fully agree with theory when using the proposed methods.
Spaces of polynomials are shown to be Euclidean balls.
problem Understanding the geometry of Lorentzian and real stable polynomials.
method Refined connection between symmetric exclusion process and polynomial geometry.
result Spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls.