arXiv research

This paper reviews and introduces measures for data representativity in AI systems.

After defining reduced minimum braid word and criteria for a braid family representative, different braid family representatives are derived, and a correspondence between them and families of knots and links given in Conway notation is established.

After a review of several methods designed to produce equivariant cohomology classes, we apply one introduced by Berline, Getzler and Vergne, to get a family of representatives of the universal Thom class of a vector bundle. Surprisingly, this family does not contain the representative given by Mathaï and Quillen. Howe…

The paper introduces group-representative clustering to ensure fair representation of different groups in clusters.

The paper explores knots' height, trunk, and representativity, finding gaps and bounds.

Study harmonic representatives and cohomology of Oeljeklaus-Toma manifolds.

Optimizes sample weights for representative data averages.

As previously known, all 3-manifolds of genus two can be represented by edge-coloured graphs uniquely defined by 6-tuples of integers satisfying simple conditions. The present paper describes an ``elementary transformation'' on these 6-tuples which changes the associated graph but does not change the represented manifo…

In the present paper, we will show that a $(p,q,r)$-pretzel knot has the representativity 3 if and only if $(p,q,r)$ is either $\pm(-2,3,3)$ or $\pm(-2,3,5)$. We also show that a large algebraic knot has the representativity less than or equal to 3.

Researchers found a regular language for maximal lexicographic representatives in braid monoids.

A new hierarchical clustering method selects representative points from sub-minimum-spanning-trees.

The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.

A novel method for estimating group-representative functional networks from multi-subject fMRI data.

For $SU(2)$ (or $SO(3)$) Donaldson theory on a 4-manifold $X$, we construct a simple geometric representative for $μ$ of a point. Let $p$ be a generic point in $X$. Then the set $\{ [A] | F_A^-(p)$ is reducible $\}$, with coefficient -1/4 and appropriate orientation, is our desired geometric representative.

New Legendrian bounds for non-fibered knots in 3-manifolds.

A new multi-class active learning method combining informativeness and representativeness.

In an $n$-manifold $X$ each element of $H_{n-1}(X; \mathbb{Z}_2)$ can be represented by an embedded codimension-1 submanifold. Hence for any two such submanifolds there is a third one that represents the sum of their homology classes. We construct such a representative explicitly. We describe the analogous construction…

The paper develops a model using risk-neutral pricing for financial decision-making.

We derive an obstruction to representing a homology class of a symplectic 4-manifold by an embedded, possibly disconnected, symplectic surface.

We demonstrate a limitation of discounted expected utility, a standard approach for representing the preference to risk when future cost is discounted. Specifically, we provide an example of the preference of a decision maker that appears to be rational but cannot be represented with any discounted expected utility. A …

MOSAIC selects few informative exemplars from high-dimensional data with non-linear structures.

New flows represent Thurston norm ball faces, differing by veering mutations.

The paper finds Riemannian metric representatives for Stiefel-Whitney classes.

We underline some differences between the geometric aspect of Berezin's approach to quantization on homogeneous Kähler manifolds and Bergman's construction for bounded domains in $\mathbb{C}^n$. We construct explicitly the Bergman representative coordinates for the Siegel-Jacobi disk $\mathcal{D}^J_1$, which is a parti…

This study optimizes cycle representatives in persistent homology using linear programming.

We study the incompressible surfaces in the exterior of a cable knot and use this to compute the representativity and waist of most cable knots.

Reducing neural network training time by using smaller, representative datasets.

With the growing interest on Network Analysis, Relational Data Mining is becoming an emphasized domain of Data Mining. This paper addresses the problem of extracting representative elements from a relational dataset. After defining the notion of degree of representativeness, computed using the Borda aggregation procedu…

It is known that for each combinatorial type of convex 3-dimensional polyhedra, there is a representative with edges tangent to the unit sphere. This representative is unique up to projective transformations that fix the unit sphere. We show that there is a unique representative (up to congruence) with edges tangent to…

In 1997, Chekanov gave the first example of a Legendrian nonsimple knot type: the $m(5_2)$ knot. Epstein, Fuchs, and Meyer extended his result by showing that there are at least $n$ different Legendrian representatives with maximal Thurston--Bennequin number of the twist knot $K_{-2n}$ with crossing number $2n+1$. In t…

Correct method found for drawing precise envelope of straight lines.

Paper proves corner connection tiles can represent knots with fewer tiles.

Given an orientable surface with boundary and a free homotopy class, we present a purely combinatorial algorithm which produces a representative of that homotopy class with minimal self intersection.

New examples show immersions not homologous to embeddings.

Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual link diagrams, that are represented by the same ribbon graphs are related to eac…

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

Study special complexified Kähler forms in mirror symmetry.

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $σ_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical evidence for this conjecture, and prove two results: (1) The algorithm terminates in …

We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally planar tangle diagrams.

Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm…

AEC Games model represents software MARL environments better than POSGs.

This note gives a correction to the proof of the main result of "Harmonic representatives for cuspidal cohomology classes" by J. Dodziuk, J. McGowan and Peter Perry, an article that appeared in Serge Lang memorial volume.

FCL3 learns from multiple representative models to adapt to new tasks.

In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with in…

In this paper, we propose a novel framework to analyze the theoretical properties of the learning process for a representative type of domain adaptation, which combines data from multiple sources and one target (or briefly called representative domain adaptation). In particular, we use the integral probability metric t…

Incremental clustering approaches have been proposed for handling large data when given data set is too large to be stored. The key idea of these approaches is to find representatives to represent each cluster in each data chunk and final data analysis is carried out based on those identified representatives from all t…

Paper classifies surface-links using charts with specific properties.

This paper proposes new methods for ALR that consider informativeness, representativeness, and diversity.