English
Related papers

Related papers: Structure theorem of square complex orthogonal des…

200 papers

We prove that the upper bound for the van der Corput property of the set of perfect squares is O((log n)^{-1/3}), giving an answer to a problem considered by Ruzsa and Montgomery. We do it by constructing non-negative valued, normed…

Number Theory · Mathematics 2010-03-22 Sinisa Slijepcevic

Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…

Computational Geometry · Computer Science 2023-03-16 Egor Gorbachev , Marvin Künnemann

This article determines the structure of the group ring $\mathbb{Z}_nG$, where $G$ is a finite group and $\mathbb{Z}_n$ is the ring of integers modulo $n$, such that $n$ is relatively prime to the order of $G$. The decomposition of…

Rings and Algebras · Mathematics 2026-03-30 Jyoti Garg , Sugandha Maheshwary , Himanshu Setia

We study the algebraic and geometric properties of stated skein algebras of surfaces with punctured boundary. We prove that the skein algebra of the bigon is isomorphic to the quantum group ${\mathcal O}_{q^2}(\mathrm{SL}(2))$ providing a…

Geometric Topology · Mathematics 2020-11-03 Francesco Costantino , Thang T. Q. Le

A $q$-covering design $\mathbb{C}_q(n, k, r)$, $k \ge r$, is a collection $\mathcal X$ of $(k-1)$-spaces of $\mathrm{PG}(n-1, q)$ such that every $(r-1)$-space of $\mathrm{PG}(n-1, q)$ is contained in at least one element of $\mathcal X$ .…

Combinatorics · Mathematics 2019-04-30 Francesco Pavese

We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…

Group Theory · Mathematics 2024-07-24 Sheehan Olver

We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…

Optimization and Control · Mathematics 2026-01-21 Liqun Qi , Chunfeng Cui , Yi Xu

For a subspace $W$ of a vector space $V$ of dimension $n$, the Schur-product space $W^{\langle k\rangle}$ for $k \in \mathbb{N}$ is defined to be the span of all vectors formed by the component-wise multiplication of $k$ vectors in $W$. It…

Information Theory · Computer Science 2018-10-19 Brett Hemenway Falk , Nadia Heninger , Michael Rudow

For prime powers q we use "strongly orthogonal" linear Sudoku solutions of order q^2 to construct ordered orthogonal arrays of type OOA (4,s,2,q), and for each q we present a range of values of s for which these constructions are valid.

Combinatorics · Mathematics 2014-12-22 John Lorch

Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $\mathbf{ \lambda_a=0} $, and in all but one case a cross correlation of $ \mathbf{\lambda_c=1} $. All…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson

For all $d$ belonging to a density-$1/8$ subset of the natural numbers, we give an example of a square-tiled surface conjecturally realizing the group $\mathrm{SO}^*(2d)$ in its standard representation as the Zariski-closure of a factor of…

Dynamical Systems · Mathematics 2019-04-09 Rodolfo Gutiérrez-Romo

M/string theory on noncompact, negatively curved, cosets which generalize $AdS_{D+1}=SO(D,2)/SO(D,1)$ is considered. Holographic descriptions in terms of a conformal field theory on the boundary of the spacetime are proposed. Examples…

High Energy Physics - Theory · Physics 2009-10-31 Ruth Britto-Pacumio , Andrew Strominger , Anastasia Volovich

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Combinatorics · Mathematics 2014-01-14 Andrew Suk

It is well known that the Space-time Block Codes (STBCs) from Complex orthogonal designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD). The weight matrices of the square CODs are all unitary and obtainable from the…

Information Theory · Computer Science 2016-11-17 Sanjay Karmakar , K. Pavan Srinath , B. Sundar Rajan

The hulls of linear and cyclic codes over finite fields have been of interest and extensively studied due to their wide applications. In this paper, the hulls of cyclic codes of length $n$ over the ring $\mathbb{Z}_4$ have been focused on.…

Information Theory · Computer Science 2019-02-28 Somphong Jitman , Ekkasit Sangwisut , Patanee Udomkavanich

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…

Data Structures and Algorithms · Computer Science 2024-03-12 Panagiotis Charalampopoulos , Paweł Gawrychowski , Samah Ghazawi

For $r,n\ge2$, an ordered $r$-uniform matching of size $n$ is an $r$-uniform hypergraph on a linearly ordered vertex set $V$, with $|V|=rn$, consisting of $n$ pairwise disjoint edges. There are $\tfrac12\binom{2r}r$ different ways two edges…

Combinatorics · Mathematics 2024-10-01 Andrzej Dudek , Jarosław Grytczuk , Andrzej Ruciński

This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…

Discrete Mathematics · Computer Science 2012-07-24 Mahyuddin K. M. Nasution

Optical orthogonal signature pattern codes (OOSPCs) play an important role in a novel type of optical code-division multiple-access (CDMA) network for 2-dimensional image transmission. There is a one-to-one correspondence between an $(m, n,…

Discrete Mathematics · Computer Science 2016-09-26 Jingyuan Chen , Yun Li , Lijun Ji

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

Combinatorics · Mathematics 2018-11-29 Ishay Haviv