We use Nathanson's g-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets S to problems in additive number theory. If S consists of all powers of a fixed integer g, we find explicit formulas for the smallest positive intege…
The study explores which sets of integers can be realized as the degrees of maps between manifolds.
problem Which sets of integers can be realized as the degrees of maps between manifolds?
method Analyzes the set of degrees of maps between closed oriented manifolds of the same dimension.
result Finite arithmetic progressions and geometric progressions starting from 1 can be realized as degrees of maps between manifolds.
New examples show non-integer Hausdorff dimensions in collapsing spaces.
problem Understanding Hausdorff dimensions in collapsing Ricci limit spaces.
method Provided examples of spaces with irregular Hausdorff dimensions.
result Hausdorff dimension of singular set exceeds regular set's dimension.
Optimizes intervention design for causal discovery using integer programming.
problem Identifying causal structures from observational data due to confounding variables.
method Uses integer programming to design minimal intervention sets for causal structure identifiability.
result Provides exact and modular solutions adaptable to various experimental settings and constraints.
New method for probabilistic modeling of integer submodular functions.
problem Lack of probabilistic modeling for integer submodular functions.
method Proposed Generalized Multilinear Extension and block-coordinate ascent algorithm.
result Demonstrated effectiveness and viability on real-world datasets.
The paper proves smoothness of stationary varifolds.
problem Understanding the smoothness of stationary varifolds.
method Analyzing m-dimensional integer rectifiable varifolds in open sets. result The support of stationary varifolds is C∞ rectifiable. The article calculates a multiplying factor to convert rational Vassiliev invariants to integer-valued ones.
problem Converting rational valued Vassiliev invariants to integer-valued ones.
method Calculates the minimal multiplying factor λ needed for rational Vassiliev invariants to become integer-valued.
result Obtains a set of integer-valued Vassiliev invariants.
In this paper we investigate discrete time trading under integer constraints, that is, we assume that the offered goods or shares are traded in integer quantities instead of the usual real quantity assumption. For finite probability spaces and rational asset prices this has little effect on the core of the theory of no…
Study of lambda lengths in figure eight knot complement using Eisenstein integers.
problem Determining lambda lengths in the figure eight knot complement.
method Using hyperbolic geometry and spinors, mapping lambda lengths to Eisenstein integers.
result Lambda lengths are precisely the Eisenstein integers, up to multiplication by a unit.
We propose a simple yet powerful framework for modeling integer-valued data, such as counts, scores, and rounded data. The data-generating process is defined by Simultaneously Transforming and Rounding (STAR) a continuous-valued process, which produces a flexible family of integer-valued distributions capable of modeli…
Introduces integer-valued Heegaard Floer theory with canonical orientations.
problem Defining and proving properties of Heegaard Floer homology over integers.
method Using canonical orientations from coupled Spin structures, proving naturality and surgery exact triangle.
result Established integer-valued Heegaard Floer theory and proved its properties.
The study examines vector fields with integer singularities in 3D balls.
problem Characterizing the strong Lp-closure of vector fields with finitely many integer singularities. method Characterization and decomposition of vector fields with finitely many integer singularities.
result Decomposition theorem for elements in LZ1(B), revealing information about mass-minimizing currents. We establish a necessary and sufficient condition for pairs of integers to arise as the weights at the fixed points of an effective circle action on a compact almost complex 4-manifold with a discrete fixed point set. As an application, we provide a necessary and sufficient condition for a pair of integers to arise as …
We establish the existence of an integer degree for the natural projection map from the space of parameterizations of asymptotically conical self-expanders to the space of parameterizations of the asymptotic cones when this map is proper. As an application we show that there is an open set in the space of cones in the …
Study extends contact cosmetic surgeries to non-trivial Legendrian knots in L-spaces.
problem Contact cosmetic surgeries for Legendrian knots in L-spaces.
method Adapting techniques from S3 to L-spaces, incorporating Heegaard Floer theory constraints.
result Contact cosmetic surgery conjecture holds for non-trivial Legendrian knots, except for Lagrangian slice knots.
The study explores mapping degree sets and their properties for manifolds.
problem Understanding the structure and properties of mapping degree sets for manifolds.
method Analyzes the properties of mapping degree sets and their relationships with self-mapping degree sets.
result Not every multiplicative set containing 0,1 is a self-mapping degree set.
Study spectral invariants over integers, discovering unboundedness and field-dependence.
problem Dependence of spectral invariants on integer coefficients.
method Floer homology theory, focusing on Hamiltonian Floer homology.
result Spectral norm is unbounded over integers for complex projective spaces.
In the paper, we focus on the connectedness of planar self-affine sets T(A,D) generated by an integer expanding matrix A with ∣det(A)∣=3 and a collinear digit set D={0,1,b}v, where b>1 and v∈R2 such that {v,Av} is linearly independent. We discuss the domain of…
A referee found an error in the proof of the Theorem 2 that we could not fix. More precisely, the proof of Lemma 2.1 is incorrect. Hence the fact that integer cohomology of complement of toric Weyl arrangements is torsion free is still a conjecture. ----- A toric arrangement is a finite set of hypersurfaces in a comple…
We consider a two-valued function u that is either Dirichlet energy minimizing, C1,μ harmonic, or in C1,μ with an area-stationary graph such that Almgren's frequency (restricted to the singular set) is continuous at a singular point Y0. As a corollary of recent work of Wickramasekera and the author, if t…
We use a new combinatorial technique to prove the optimal interior partial regularity result for Lp-vectorfields with integer fluxes minimizing the Lp-energy. More precisely, we prove that the minimal vectorfields are Hölder outside a set which is locally finite inside the domain. The results continue the program start…
Let X be a topological space and f:X→X a bijection. Let C(X,f) be a set of integers such that an integer n is an element of C(X,f) if and only if the bijection fn:X→X is continuous. A subset S of the set of integers Z is said to be realizable if there is a topologi…
Study Betti and Hodge numbers of solvmanifolds from integer polynomials.
problem Computing Betti and Hodge numbers of solvmanifolds constructed from integer polynomials.
method Analyzing de Rham and Dolbeault cohomology of solvmanifolds under algebraic conditions.
result Explicit generating polynomials for Hodge numbers in quasi full rank case.
Study non-integer power-law potentials for Schrödinger operators using Lie-Rinehart algebras.
problem Analyzing Schrödinger operators with non-integer power-law potentials.
method Using Lie-Rinehart algebras and microlocal analysis.
result Microlocal analysis can be applied to Schrödinger operators with non-integer power-law potentials.
Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow-based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, con…
Paper introduces DP methods for high-dimensional variable selection.
problem Sparse variable selection in high-dimensional learning.
method Pure differentially private estimators using Integer Programming.
result Achieves state-of-the-art empirical support recovery.
New q-deformed integers help compute Jones polynomials efficiently.
problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.
We study the problem of instance segmentation in biological images with crowded and compact cells. We formulate this task as an integer program where variables correspond to cells and constraints enforce that cells do not overlap. To solve this integer program, we propose a column generation formulation where the prici…
The 3D index of Dimofte-Gaiotto-Gukov a partially defined function on the set of ideal triangulations of 3-manifolds with r torii boundary components. For a fixed 2r tuple of integers, the index takes values in the set of q-series with integer coefficients. Our goal is to give an axiomatic definition of the tetra…
This paper classifies quadratic form parameters over integers and computes their Witt groups.
problem Classifying quadratic form parameters over integers and computing their Witt groups.
method Study of quadratic forms and extended quadratic forms over the integers, defining and comparing different definitions of extended quadratic forms.
result Classification of all quadratic form parameters over the integers and computation of their Witt groups.
Study determines left-orderable properties of knot covers.
problem Determining left-orderability of knot covers.
method Analyzing 2-bridge knots, including double-twist knots, using cyclic branched covers.
result Identifies specific integers for left-orderability of knot covers.
Generalized Steinberg module presentation for Gaussian and Eisenstein integers.
problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.
The crosscap number of a knot is an invariant describing the non-orientable surface of smallest genus that the knot bounds. Unlike knot genus (its orientable counterpart), crosscap numbers are difficult to compute and no general algorithm is known. We present three methods for computing crosscap number that offer varyi…
We present a new proof of Thurston's theorem that the unit ball of a seminorm on Rd taking integer values on Zd is a polyhedra defined by finitely many inequalities with integer coefficients.
We introduce the Schubert form a 3-bridge link diagram, as a generalization of the Schubert normal form of a 3-bridge link. It consists of a set of six positive integers, written as (p/n,q/m,s/l), with some conditions and it is based on the concept of 3-butterfly. Using the Schubert normal form of …
Surgery obstructions extended to integer homology spheres using Heegaard Floer homology.
problem Obstructing knots in integer homology spheres using surgery.
method Extending Heegaard Floer homology obstructions to all integer homology spheres for both positive and negative surgeries.
result Deduced a lower bound on b2(W) for smooth cobordism between integer homology spheres. A new method computes Teichmüller polynomials from integer permutations.
problem Computing Teichmüller polynomials for fibered 3-manifolds.
method Using integer permutations to characterize pseudo-Anosov homeomorphisms and train tracks.
result Direct implementation of McMullen's algorithm for Teichmüller polynomials.
Paper designs optimal ECOCs using IP for robust multiclass classification.
problem Designing robust ECOCs for multiclass classification.
method Integer Programming formulation to minimize codebooks with desirable error-correcting properties, leveraging graph-theoretic structure and edge clique covers.
result IP-generated codebooks achieve high nominal and robust adversarial accuracy.
Study on coloring virtual tangles with integer and modular arithmetic.
problem Characterizing Fox colorings of virtual tangle diagrams.
method Analyzed classical and virtual tangle diagrams using vector representations and divisibility conditions.
result For R=Z, realizability depends on divisibility of the alternating sum. For R=Z/pZ, all vectors are realizable. IDF++ improves integer discrete flows for lossless compression.
problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.
This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a "mixed pol…
New links split by integer homology spheres but not by others.
problem Characterizing links split by integer homology spheres.
method Constructing specific links and homology spheres.
result Infinite families of links and homology spheres split by specific ones but not by others.
Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.
problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.
New harmonic functions show nodal sets can be topologically complex despite frequency and regularity constraints.
problem Understanding the topology of nodal sets of harmonic functions with bounded frequency and regularity.
method Constructing harmonic functions on the unit ball with specific properties.
result The Betti numbers of the nodal set can be arbitrarily large, contradicting previous topological bounds.
Geometric proof shows primes of form 3k+1 are norms of Eisenstein integers.
problem Geometric proof of primes of form 3k+1 being norms of Eisenstein integers.
method Geometric proof using Penner's λ-length and norms of Eisenstein integers.
result Every prime p of the form 3k+1 is the norm of an Eisenstein integer. Study proves existence of a specific type of flow in geometry.
problem Existence of canonical multi-phase free boundary Brakke flows.
method Global-in-time existence established using Brakke flow and uniform density ratio assumption.
result Existence of the flow with no positive mass on the free boundary for some short time.
This dissertation uses ILP to learn Bayesian network structures efficiently.
problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.
Analyzes biased random walks and corrupted intervals in adversarial settings.
problem Learning thresholds and intervals in adversarial conditions.
method Analyzes biased random walks and corrupted intervals under adversarial design.
result Analyzes the expected behavior of biased random walks and corrupted intervals.