English
Related papers

Related papers: Partial Difference Sets in $C_{2^n} \times C_{2^n}…

200 papers

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

In 1997 Cochran-Orr-Teichner introduced a natural filtration, called the n-solvable filtration, of the smooth knot concordance group, C. Its terms {F_n} are indexed by half integers. We show that each associated graded abelian group…

Geometric Topology · Mathematics 2011-03-15 Tim D. Cochran , Shelly Harvey , Constance Leidy

For each natural number $n$, we consider the subgroup $\mathcal{R}_n$ of Homeo$_+[0,1]$ made by the elements that are linear except for a subset whose Cantor-Bendixson rank is less than or equal to $n$. These groups of generalized…

Group Theory · Mathematics 2024-06-21 Leonardo Dinamarca Opazo

We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions…

Numerical Analysis · Mathematics 2018-04-25 Evan S. Gawlik , Yuji Nakatsukasa , Brian D. Sutton

The Curry-Howard correspondence is often called the proofs-as-programs result. I offer a generalization of this result, something which may be called machines as programs. Utilizing this insight, I introduce two new Turing Machines called…

Computational Complexity · Computer Science 2021-09-23 Jonathan J. Mize

Colloidal particles are distinguishable. Moreover, their thermodynamic properties are extensive. Statistical Mechanics predicts such behaviour if one accepts that the configurational integral of a system of N colloids must be divided by N!.…

Soft Condensed Matter · Physics 2015-06-18 Daan Frenkel

We study the problem of identifying unknown processes embedded in time-dependent partial differential equation (PDE) using observational data, with an application to advection-diffusion type PDE. We first conduct theoretical analysis and…

Numerical Analysis · Mathematics 2021-07-13 Zhen Chen , Kailiang Wu , Dongbin Xiu

A proportionally modular affine semigroup is the set of nonnegative integer solutions of a modular Diophantine inequality $f_1x_1+\cdots +f_nx_n \mod b \le g_1x_1+\cdots +g_nx_n$ where $g_1,\dots,g_n,$ $f_1,\ldots ,f_n\in \mathbb{Z}$ and…

Commutative Algebra · Mathematics 2019-06-05 J. D. Díaz-Ramírez , J. I. García-García , A. Sánchez-R. -Navarro , A. Vigneron-Tenorio

The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…

Data Structures and Algorithms · Computer Science 2017-07-13 Nikhil Bansal , Shashwat Garg

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

Combinatorics · Mathematics 2013-09-27 Mikhail Kharitonov

In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of…

Numerical Analysis · Computer Science 2013-04-23 P. N. Vabishchevich , V. I. Vasil'ev

Skew Hadamard difference sets are an interesting topic of study for over seventy years. For a long time, it had been conjectured the classical Paley difference sets (the set of nonzero quadratic residues in $\mathbb{F}_q$ where $q \equiv 3…

Combinatorics · Mathematics 2013-05-09 Cunsheng Ding , Alexander Pott , Qi Wang

Anomaly detection (AD) in images, identifying significant deviations from normality, is a critical issue in computer vision. This paper introduces a novel approach to dimensionality reduction for AD using pre-trained convolutional neural…

Computer Vision and Pattern Recognition · Computer Science 2023-12-05 Tetiana Gula , João P C Bertoldo

We study finite groups $G$ having a normal subgroup $H$ and $D \subset G \setminus H, D \cap D^{-1}=\emptyset,$ such that the multiset $\{ xy^{-1}:x,y \in D\}$ has every non-identity element occur the same number of times (such a $D$ is…

Group Theory · Mathematics 2021-03-19 Stephen P. Humphries , Nathan L. Nicholson

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Symbolic Computation · Computer Science 2024-11-21 Lucas Michel , Pierre Mathonet , Naïm Zénaïdi

Partial difference sets (for short, PDSs) with parameters ($n^2$, $r(n-\epsilon)$, $\epsilon n+r^2-3\epsilon r$, $r^2-\epsilon r$) are called Latin square type (respectively negative Latin square type) PDSs if $\epsilon=1$ (respectively…

Combinatorics · Mathematics 2019-05-10 Zeying Wang

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

Rings and Algebras · Mathematics 2021-11-16 Artem Lopatin

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

Data Structures and Algorithms · Computer Science 2024-11-07 Mitali Bafna , Jun-Ting Hsieh , Pravesh K. Kothari

We enumerate the number of complex irreducible representations of each degree of general unitary groups of degree 4 over principal ideal rings of length 2.

Representation Theory · Mathematics 2016-02-15 Matthew Levy